Chains with Complete Connections: General Theory, Uniqueness, Loss of Memory and Mixing Properties

@article{Fernndez2003ChainsWC,
  title={Chains with Complete Connections: General Theory, Uniqueness, Loss of Memory and Mixing Properties},
  author={Roberto Fern{\'a}ndez and Gr'egory Maillard},
  journal={Journal of Statistical Physics},
  year={2003},
  volume={118},
  pages={555-588}
}
We introduce a statistical mechanical formalism for the study of discrete-time stochastic processes with which we prove: (i) General properties of extremal chains, including triviality on the tail σ-algebra, short-range correlations, realization via infinite-volume limits and ergodicity. (ii) Two new sufficient conditions for the uniqueness of the consistent chain. The first one is a transcription of a criterion due to Georgii for one-dimensional Gibbs measures, and the second one corresponds… 
Chains with Complete Connections and One-Dimensional Gibbs Measures
TLDR
The equivalence of uniqueness criteria for chains and fields is discussed, bounds for the continuity rates of the respective systems of finite-volume conditional probabilities are established and a (re)construction theorem for specifications starting from single-site conditioning is proved.
Attractive regular stochastic chains: perfect simulation and phase transition
Abstract We prove that uniqueness of the stationary chain, or equivalently, of the $g$-measure, compatible with an attractive regular probability kernel is equivalent to either one of the following
Non-regular g-measures and variable length memory chains
It is well-known that there always exists at least one stationary measure compatible with a continuous g-function g. Here we prove that if the set of discontinuities of a g-function g has null
Optimal Gaussian concentration bounds for stochastic chains of unbounded memory
TLDR
It is proved that a GCB holds when the sum of oscillations of the Kernel is less than one, or when the variation of the kernel is summable, i.e., belongs to l^1(N).
Large Deviations Properties of Maximum Entropy Markov Chains from Spike Trains
TLDR
This work provides an accessible introduction to the maximum entropy Markov chain inference problem and large deviations theory to the community of computational neuroscience, avoiding some technicalities while preserving the core ideas and intuitions.
Variable Length Memory Chains: Characterization of stationary probability measures
Variable Length Memory Chains (VLMC), which are generalizations of finite order Markov chains, turn out to be an essential tool to modelize random sequences in many domains, as well as an interesting
Invariance principles for operator-scaling Gaussian random fields
TLDR
A natural generalization of a model of correlated random walks that scale to fractional Brownian motions with long-range dependence to dimension $d\geq 2$ is considered, which forms a general class of operator-scaling Gaussian random fields.
Discrete-time Ornstein-Uhlenbeck process in a stationary dynamic environment
Abstract We study the stationary solution to the recursion Xn+1=γ Xn+ξn , where γ ∈ (0,1) is a constant and ξn are Gaussian variables with random parameters. Specifically, we assume that ξn=µn+σ nεn,
Coupling and perturbation techniques for categorical time series
We present a general approach for studying autoregressive categorical time series models with dependence of infinite order and defined conditional on an exogenous covariate process. To this end, we
...
...

References

SHOWING 1-10 OF 39 REFERENCES
Chains and specifications
We review four types of results combining or relating the theories of discrete-time stochastic processes and of one-dimensional specifications. First we list some general properties of stochastic
Chains with Complete Connections and One-Dimensional Gibbs Measures
TLDR
The equivalence of uniqueness criteria for chains and fields is discussed, bounds for the continuity rates of the respective systems of finite-volume conditional probabilities are established and a (re)construction theorem for specifications starting from single-site conditioning is proved.
Chains with infinite connections: Uniqueness and Markov representation
SummaryIf for a process $$(\xi _n )_{n = - \infty }^\infty$$ the conditional distribution of ξn given the past does not depend on n for e.g. n≧0, then the process may be called a chain with
Regularity properties and pathologies of position-space renormalization-group transformations: Scope and limitations of Gibbsian theory
We reconsider the conceptual foundations of the renormalization-group (RG) formalism, and prove some rigorous theorems on the regularity properties and possible pathologies of the RG map. Our main
Decay of Correlations for Non-Hölderian Dynamics. A Coupling Approach
We present an upper bound on the mixing rate of the equilibrium state of a dynamical system defined by the one-sided shift and a non Holder potential of summable variations. The bound follows from an
Ruelle’s operator theorem and $g$-measures
We use g-measures to give a proof of a convergence theorem of Ruelle. The method of proof is used to gain information about the ergodic properties of equilibrium states for subshifts of finite type.
Real Analysis and Probability
1. Foundations: set theory 2. General topology 3. Measures 4. Integration 5. Lp spaces: introduction to functional analysis 6. Convex sets and duality of normed spaces 7. Measure, topology, and
Square summability of variations of g-functions and uniqueness of g-measures
We prove uniqueness of $g$-measures for $g$-functions satisfying quadratic summability of variations. Our result is in contrast to the situation of, \eg, the one-dimensional Ising model with
Statistical mechanics of a one-dimensional lattice gas
We study the statistical mechanics of an infinite one-dimensional classical lattice gas. Extending a result ofvan Hove we show that, for a large class of interactions, such a system has no phase
...
...