Regenerative representation for one-dimensional Gibbs states

From MaRDI portal
Publication:1088310

DOI10.1214/aop/1176992367zbMath0612.60093OpenAlexW2039195625WikidataQ105584337 ScholiaQ105584337MaRDI QIDQ1088310

Steven P. Lalley

Publication date: 1986

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176992367




Related Items

Regeneration for chains with infinite memorySpeed of \(\overline d\)-convergence for Markov approximations of chains with complete connections. A coupling approachRenewal theorem for a class of stationary sequencesOn distributionally regenerative processesChains with infinite connections: Uniqueness and Markov representationDecrease of Fourier coefficients of stationary measuresChains with unbounded variable length memory: perfect simulation and a visible regeneration schemeStationary processes whose filtrations are standardCP-chains and dimension preservation for projections of \((\times m,\times n)\)-invariant Gibbs measuresPerfect simulation of a coupling achieving the \(\bar{d}\)-distance between ordered pairs of binary chains of infinite orderOne-dimensional infinite memory imitation models with noiseRenewal theorems in symbolic dynamics, with applications to geodesic flows, noneuclidean tessellations and their fractal limitsRandom linear recursions with dependent coefficientsRenewal representations for Markov operatorsNon-uniqueness for specifications inChains with complete connections: general theory, uniqueness, loss of memory and mixing propertiesKleinian Schottky groups, Patterson-Sullivan measures, and Fourier decayPerfect simulation of processes with long memory: A “coupling into and from the past” algorithmLocal geometry of random geodesics on negatively curved surfacesDivergent Perpetuities Modulated by Regime Switches