Chains with complete connections and one-dimensional {G}ibbs measures
From MaRDI portal
Publication:1767516
Abstract: We discuss the relationship between discrete-time processes (chains) and one-dimensional Gibbs measures. We consider finite-alphabet (finite-spin) systems, possibly with a grammar (exclusion rule). We establish conditions for a stochastic process to define a Gibbs measure and vice versa. Our conditions generalize well known equivalence results between ergodic Markov chains and fields, as well as the known Gibbsian character of processes with exponential continuity rate. Our arguments are purely probabilistic; they are based on the study of regular systems of conditional probabilities (specifications). Furthermore, we discuss the equivalence of uniqueness criteria for chains and fields and we establish bounds for the continuity rates of the respective systems of finite-volume conditional probabilities. As an auxiliary result we prove a (re)construction theorem for specifications starting from single-site conditioning, which applies in a more general setting (general spin space, specifications not necessarily Gibbsian).
Recommendations
Cited in
(15)- On the relation between Gibbs and \(g\)-measures
- One-sided versus two-sided stochastic descriptions
- Entropic repulsion and lack of the \(g\)-measure property for Dyson models
- Chains with complete connections: general theory, uniqueness, loss of memory and mixing properties
- Weakly dependent chains with infinite memory
- scientific article; zbMATH DE number 2139715 (Why is no real title available?)
- Continuity properties of a factor of Markov chains
- Chains of infinite order, chains with memory of variable length, and maps of the interval
- Partially ordered models
- Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets
- One-sided continuity properties for the schonmann projection
- Decimation of the Dyson-Ising ferromagnet
- Non-uniqueness for specifications in \(\ell^{2+\epsilon}\)
- Random linear recursions with dependent coefficients
- Gaussian concentration bounds for stochastic chains of unbounded memory
This page was built for publication: Chains with complete connections and one-dimensional {G}ibbs measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767516)