Perfect simulation of a coupling achieving the \(\bar{d}\)-distance between ordered pairs of binary chains of infinite order

DOI10.1007/s10955-010-0071-0zbMath1205.82038arXiv0907.1113OpenAlexW3100950204WikidataQ105585003 ScholiaQ105585003MaRDI QIDQ616210

Nancy L. Garcia, Clémentine Prieur, Antonio Galves

Publication date: 7 January 2011

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.1113

zbMATH Keywords

chains of infinite orderordered binary chainsOrnstein's \(\bar{d}\)-distanceregenerative scheme

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Classical equilibrium statistical mechanics (general) (82B05)

Related Items (2)

Kalikow-type decomposition for multicolor infinite range particle systems ⋮ Information transmission and criticality in the contact process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On chains of infinite order
• Random Markov processes and uniform martingales
• Chains with infinite connections: Uniqueness and Markov representation
• Regenerative representation for one-dimensional Gibbs states
• On Kamae's conjecture concerning the d-distance between two-state Markov processes
• Conditions for attaining d by a Markovian joining
• The \(\bar d\)-distance between two Markov processes cannot always be attained by a Markov joining
• An application of ergodic theory to probability theory
• Processes with long memory: Regenerative construction and perfect simulation
• Distances between Two-State Markov Processes Attainable by Markov Joinings
• Cesàro mean distribution of group automata starting from measures with summable decay

This page was built for publication: Perfect simulation of a coupling achieving the \(\bar{d}\)-distance between ordered pairs of binary chains of infinite order