Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme
From MaRDI portal
Publication:3173003
Abstract: We present a new perfect simulation algorithm for stationary chains having unbounded variable length memory. This is the class of infnite memory chains for which the family of transition probabilities is represented by a probabilistic context tree. We do not assume any continuity condition: our condition is expressed in terms of the structure of the context tree. More precisely, the length of the contexts is a deterministic function of the distance to the last occurrence of some determined string of symbols. It turns out that the resulting class of chains can be seen as a natural extension of the class of chains having a renewal string. In particular, our chains exhibit a visible regeneration scheme.
Recommendations
- Perfect simulation of processes with long memory: a ``coupling into and from the past algorithm
- Processes with long memory: Regenerative construction and perfect simulation
- Perfect simulation of autoregressive models with infinite memory
- Perfect simulation for locally continuous chains of infinite order
- Backward coalescence times for perfect simulation of chains with infinite memory
Cites work
- scientific article; zbMATH DE number 1193442 (Why is no real title available?)
- scientific article; zbMATH DE number 44591 (Why is no real title available?)
- scientific article; zbMATH DE number 2051870 (Why is no real title available?)
- scientific article; zbMATH DE number 3018039 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A universal data compression system
- Chains with infinite connections: Uniqueness and Markov representation
- Context trees, variable length Markov chains and dynamical sources
- Decay of correlations for non Hölderian dynamics. A coupling approach
- Equilibrium states and the ergodic theory of Anosov diffeomorphisms
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Nonuniqueness in \(g\)-functions
- On chains of infinite order
- Perfect simulation and backward coupling∗
- Processes with long memory: Regenerative construction and perfect simulation
- Random Markov processes and uniform martingales
- Regenerative representation for one-dimensional Gibbs states
- Square summability of variations of g-functions and uniqueness of g-measures
- Sur des chaînes à liaisons complètes
Cited in
(16)- Backward coalescence times for perfect simulation of chains with infinite memory
- Attractive regular stochastic chains: perfect simulation and phase transition
- Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets
- Limit theorems for chains with unbounded variable length memory which satisfy Cramer condition
- Perfect simulation of processes with long memory: a ``coupling into and from the past algorithm
- A stochastic system with infinite interacting components to model the time evolution of the membrane potentials of a population of neurons
- Stochastically perturbed chains of variable memory
- Random perturbations of stochastic processes with unbounded variable length memory
- Local theorems for (multidimensional) additive functionals of semi-Markov chains
- Gaussian concentration bounds for stochastic chains of unbounded memory
- One-dimensional infinite memory imitation models with noise
- Processes with long memory: Regenerative construction and perfect simulation
- Stochastic Sequences with a Regenerative Structure that May Depend Both on the Future and on the Past
- Variable length memory chains: characterization of stationary probability measures
- Non-regular g-measures and variable length memory chains
- Perfect simulation for the infinite random cluster model, Ising and Potts models at low or high temperature
This page was built for publication: Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173003)
