On the public citation graph
The positive-divergence and blowing-up properties
0 signed · 55 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00535166openalex-snapshot
Finitary codes between Markov processes
inferredcites →https://doi.org/10.1007/bf00535682openalex-snapshot
Bounds on conditional probabilities with applications in multi-user communication
inferredcites →https://doi.org/10.1007/bf01066716openalex-snapshot
Two divergence-rate counterexamples
inferredcites →https://doi.org/10.1007/bf02760609openalex-snapshot
Finitary isomorphisms of irreducible Markov shifts
inferredcites →https://doi.org/10.1007/bf02760837openalex-snapshot
If a two-point extension of a Bernoulli shift has an ergodic square, then it is Bernoulli
inferredcites →https://doi.org/10.1016/0016-0032(64)90319-9openalex-snapshot
Information and information stability of random variables and processes
inferredcites →https://doi.org/10.1090/conm/135/1185104openalex-snapshot
Finitary isomorphism of 𝑚-dependent processes
inferredcites →https://doi.org/10.1090/s0273-0979-1979-14633-0openalex-snapshot
The finitary isomorphism theorem for Markov shifts
inferredcites →https://doi.org/10.1109/tit.1979.1056037openalex-snapshot
Stationary coding of processes
inferredcites →https://doi.org/10.1109/tit.1984.1056943openalex-snapshot
Review of Information Theory: Coding Theorems for Discrete Memoryless Systems (Csiszár, I., and Körner, J.; 1981)
inferredcites →https://doi.org/10.1109/tit.1986.1057176openalex-snapshot
A simple proof of the blowing-up lemma (Corresp.)
inferredcites →https://doi.org/10.1214/aop/1176990729openalex-snapshot
How Sampling Reveals a Process
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_56openalex-snapshot
Greedy algorithms for the shortest common superstring that are asymtotically optimal
inferred← citeshttps://doi.org/10.1007/978-3-0348-8405-1_7openalex-snapshot
An Universal Predictor Based on Pattern Matching: Preliminary results 1
inferred← citeshttps://doi.org/10.1007/bf01066716openalex-snapshot
Two divergence-rate counterexamples
inferred← citeshttps://doi.org/10.1007/bf02773372openalex-snapshot
TheT, T −1-process, finitary codings and weak Bernoulli
inferred← citeshttps://doi.org/10.1007/pl00009207openalex-snapshot
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal
inferred← citeshttps://doi.org/10.1007/s10240-018-0098-3openalex-snapshot
Measure concentration and the weak Pinsker property
inferred← citeshttps://doi.org/10.1007/s10955-020-02658-1openalex-snapshot
Gaussian Concentration and Uniqueness of Equilibrium States in Lattice Systems
inferred← citeshttps://doi.org/10.1007/s10955-025-03528-4openalex-snapshot
Irreversibility as Divergence from Equilibrium
inferred← citeshttps://doi.org/10.1007/s11856-025-2884-1openalex-snapshot
Factor of iid’s through stochastic domination
inferred← citeshttps://doi.org/10.1017/etds.2013.7openalex-snapshot
Attractive regular stochastic chains: perfect simulation and phase transition
inferred← citeshttps://doi.org/10.1017/s0143385700009706openalex-snapshot
Almost-sure waiting time results for weak and very weak Bernoulli processes
inferred← citeshttps://doi.org/10.1093/imrn/rnaa191openalex-snapshot
A Random Matrix Approach to Absorption in Free Products
inferred← citeshttps://doi.org/10.1109/18.312162openalex-snapshot
Error exponents for distributed detection of Markov sources
inferred← citeshttps://doi.org/10.1109/18.623143openalex-snapshot
A suboptimal lossy data compression based on approximate pattern matching
inferred← citeshttps://doi.org/10.1109/18.720532openalex-snapshot
The interactions between ergodic theory and information theory
inferred← citeshttps://doi.org/10.1109/18.749004openalex-snapshot
Asymptotic optimality of likelihood ratio threshold tests in decentralized detection
inferred← citeshttps://doi.org/10.1109/cdc.2006.377780openalex-snapshot
The 4M (Mixed Memory Markov Model) Algorithm for Finding Genes from Prokaryote Genomes
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434365openalex-snapshot
Bounds on the kullback-leibler divergence rate between hidden markov models
inferred← citeshttps://doi.org/10.1109/isit.1994.394723openalex-snapshot
Stationary processes having the blowing-up property
inferred← citeshttps://doi.org/10.1109/isit.1994.394792openalex-snapshot
Almost sure waiting time results for weak and very weak Bernoulli processes
inferred← citeshttps://doi.org/10.1109/sequen.1997.666920openalex-snapshot
On the approximate pattern occurrences in a text
inferred← citeshttps://doi.org/10.1109/tac.2007.911360openalex-snapshot
The 4M (Mixed Memory Markov Model) Algorithm for Finding Genes in Prokaryotic Genomes
inferred← citeshttps://doi.org/10.1109/tit.2002.1003834openalex-snapshot
A universal predictor based on pattern matching
inferred← citeshttps://doi.org/10.1109/tit.2004.826687openalex-snapshot
The Kullback–Leibler Divergence Rate Between Markov Sources
inferred← citeshttps://doi.org/10.1109/tit.2010.2090221openalex-snapshot
Guessing Revisited: A Large Deviations Approach
inferred← citeshttps://doi.org/10.1109/tpami.2016.2533382openalex-snapshot
Minimum Entropy Rate Simplification of Stochastic Processes
inferred← citeshttps://doi.org/10.1214/074921706000000077openalex-snapshot
Random walk in random scenery: A survey of some recent results
inferred← citeshttps://doi.org/10.1214/10-aos834openalex-snapshot
Consistency of the maximum likelihood estimator for general hidden Markov models
inferred← citeshttps://doi.org/10.1214/19-aop1405openalex-snapshot
Finitary codings for spatial mixing Markov random fields
inferred← citeshttps://doi.org/10.1214/22-aap1893openalex-snapshot
Gaussian concentration bounds for stochastic chains of unbounded memory
inferred← citeshttps://doi.org/10.1214/22-ejp778openalex-snapshot
Finitary codings for the random-cluster model and other infinite-range monotone models
inferred← citeshttps://doi.org/10.1214/aop/1022677456openalex-snapshot
On the Existence and Nonexistence of Finitary Codings for a Class of Random Fields
inferred← citeshttps://doi.org/10.1214/aop/1039639365openalex-snapshot
Bounding $\bar{d}$-distance by informational divergence: a method to prove measure concentration
inferred← citeshttps://doi.org/10.1214/lnms/1196285808openalex-snapshot
Random walk in random scenery: A survey of some recent results
inferred← citeshttps://doi.org/10.1561/0100000083openalex-snapshot
An Algebraic and Probabilistic Framework for Network Information Theory
inferred← citeshttps://doi.org/10.1561/0100000090openalex-snapshot
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
inferred← citeshttps://doi.org/10.23919/ecc.2007.7068625openalex-snapshot
Stochastic modelling over a finite alphabet: Approximation using the Kullback-Leibler divergence rate
inferred← citeshttps://doi.org/10.46298/dmtcs.3555openalex-snapshot
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding
inferred← citeshttps://doi.org/10.48550/arxiv.1008.1977openalex-snapshot
Guessing Revisited: A Large Deviations Approach
inferred← citeshttps://doi.org/10.48550/arxiv.2001.06633openalex-snapshot
Optimal Gaussian concentration bounds for stochastic chains of unbounded memory
inferred← citeshttps://doi.org/10.5281/zenodo.42196openalex-snapshot
Simplified Probability Models For Generative Tasks: A Rate-Distortion Approach
inferred← citeshttps://doi.org/10.70675/ac2422e1za412z4271zafa9z1c42a1752a60openalex-snapshot
On concentration inequalities for equilibrium states in lattice and symbolic dynamical systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.