Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme
From MaRDI portal
Publication:3173003
DOI10.1239/aap/1316792668zbMath1229.60041arXiv0907.2150WikidataQ98382963 ScholiaQ98382963MaRDI QIDQ3173003
Publication date: 10 October 2011
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.2150
Related Items
Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm, Non-regular g-measures and variable length memory chains, Stochastic Sequences with a Regenerative Structure that May Depend Both on the Future and on the Past, A stochastic system with infinite interacting components to model the time evolution of the membrane potentials of a population of neurons, Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets, One-dimensional infinite memory imitation models with noise, Local theorems for (multidimensional) additive functionals of semi-Markov chains, Variable length memory chains: characterization of stationary probability measures, Perfect simulation for the infinite random cluster model, Ising and Potts models at low or high temperature, Backward Coalescence Times for Perfect Simulation of Chains with Infinite Memory, Attractive regular stochastic chains: perfect simulation and phase transition, Limit theorems for chains with unbounded variable length memory which satisfy Cramer condition
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
- Decay of correlations for non Hölderian dynamics. A coupling approach
- Nonuniqueness in \(g\)-functions
- Square summability of variations of \(g\)-functions and uniqueness of \(g\)-measures
- Processes with long memory: Regenerative construction and perfect simulation
- Context Trees, Variable Length Markov Chains and Dynamical Sources
- A universal data compression system
- Perfect simulation and backward coupling∗
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Sur des chaînes à liaisons complètes
- Equilibrium states and the ergodic theory of Anosov diffeomorphisms