scientific article; zbMATH DE number 475333
As well-known, regeneration is a vey useful tool for proving limit theorems such as laws of large numbers, central limit theorems, and in some cases large deviation theorems. This (rather expository) paper points out to the fact that there is a regeneration structure for infinite order chains under a hypothesis on the decay of memory in the chain. [This result is proved by the authors, Probab. Theory Relat. Fields 96, No. 4, 503-520 (1993; Zbl 0792.60078)]. It is then shown that this hypothesis translates into a continuity condition on both a class of processes defined in terms of random maps and Gibbs measures, and thus a regeneration structure does exist for random maps and Gibbs measures. For the entire collection see [Zbl 0777.00028].
- Regeneration for chains with infinite memory
- Chains of infinite order, chains with memory of variable length, and maps of the interval
- Regeneration in one-dimensional Gibbs states and chains with complete connections.
- On distributionally regenerative Markov chains
- When is a Markov chain regenerative?
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4273579)