Perfect simulation for locally continuous chains of infinite order
Preprint
Abstract
We establish sufficient conditions for perfect simulation of chains of infinite order on a countable alphabet. The new assumption, localized continuity, is formalized with the help of the notion of context trees, and includes the traditional continuous case, probabilistic context trees and discontinuous kernels. Since our assumptions are more refined than uniform continuity, our algorithms perfectly simulate continuous chains faster than the existing algorithms of the literature. We provide several illustrative examples.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Attractive regular stochastic chains: perfect simulation and phase transitionErgodic Theory and Dynamical Systems, 2013
- On Rate of Convergence of Statistical Estimation of Stationary Ergodic ProcessesIEEE Transactions on Information Theory, 2010
- Gibbsian and non‐Gibbsian states at EurandomStatistica Neerlandica, 2008
- Universal finitary codes with exponential tailsProceedings of the London Mathematical Society, 2006
- Bad configurations for random walk in random scenery and related subshiftsStochastic Processes and their Applications, 2005
- Processes with long memory: Regenerative construction and perfect simulationThe Annals of Applied Probability, 2002
- Intermittency and weak Gibbs statesNonlinearity, 2000
- Almost Gibbsian versus weakly Gibbsian measuresStochastic Processes and their Applications, 1999
- Random markov processes and uniform martingalesIsrael Journal of Mathematics, 1990
- A universal data compression systemIEEE Transactions on Information Theory, 1983