Perfect simulation of a coupling achieving the d-distance between ordered pairs of binary chains of infinite order

DOI10.1007/S10955-010-0071-0zbMATH Open1205.82038arXiv0907.1113OpenAlexW3100950204WikidataQ105585003 ScholiaQ105585003MaRDI QIDQ616210FDOQ616210

Authors: N. L. Garcia, Clémentine Prieur, A. Galves 

Publication date: 7 January 2011

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

Abstract: We explicitly construct a coupling attaining Ornstein's $$-distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of iid sequence of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that we can identify the first regeneration point to the left of the origin almost surely.

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

Recommendations

• Perfect simulation of infinite range Gibbs measures and coupling with their finite range approximations
• Perfect simulation for locally continuous chains of infinite order
• A coupling construction for spin systems with infinite range interactions
• Perfect simulation for the infinite random cluster model, Ising and Potts models at low or high temperature
• Replica bounds by combinatorial interpolation for diluted spin systems
• Attractive regular stochastic chains: perfect simulation and phase transition
• Efficient numerical evaluation of thermodynamic quantities on infinite (semi-)classical chains
• The Wasserstein distance of order 1 for quantum spin systems on infinite lattices
• EXACT PARTITION FUNCTION FOR THE POTTS MODEL WITH NEXT-NEAREST NEIGHBOR COUPLINGS ON ARBITRARY-LENGTH LADDERS

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)

Cites Work

• An application of ergodic theory to probability theory
• Title not available (Why is that?)
• Processes with long memory: Regenerative construction and perfect simulation
• Regenerative representation for one-dimensional Gibbs states
• Chains with infinite connections: Uniqueness and Markov representation
• Cesàro mean distribution of group automata starting from measures with summable decay
• On chains of infinite order
• Random Markov processes and uniform martingales
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Regeneration in one-dimensional Gibbs states and chains with complete connections.
• Title not available (Why is that?)
• Distances between Two-State Markov Processes Attainable by Markov Joinings

Cited In (3)

• Kalikow-type decomposition for multicolor infinite range particle systems
• Information transmission and criticality in the contact process
• Perfect simulation for locally continuous chains of infinite order

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616210)