On the strong stability of ergodic iterations
Open Access
- 5 November 2024
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 62 (1) , 284-297
Abstract
We revisit processes generated by iterated random functions driven by a stationary and ergodic sequence. Such a process is called strongly stable if a random initialization exists for which the process is stationary and ergodic, and for any other initialization the difference of the two processes converges to zero almost surely. Under some mild conditions on the corresponding recursive map, without any condition on the driving sequence we show the strong stability of iterations. Several applications are surveyed such as generalized autoregression and queuing. Furthermore, new results are deduced for Langevin-type iterations with dependent noise and for multitype branching processes.Keywords
All Related Versions
This publication has 34 references indexed in Scilit:
- A polling model with reneging at polling instantsAnnals of Operations Research, 2010
- Towards a unifying theory on branching-type polling systems in heavy trafficQueueing Systems, 2007
- Big Queues2004
- Elements of Queueing Theory2003
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed GraphJournal of Algorithms, 1998
- Branching Process Models for Mutant Genes in Nonstationary PopulationsTheoretical Population Biology, 1997
- Exact sampling with coupled Markov chains and applications to statistical mechanicsRandom Structures & Algorithms, 1996
- Polling systems and multitype branching processesQueueing Systems, 1993
- Equilibrium distributions for deleterious genes in large stationary populationsTheoretical Population Biology, 1978
- Stochastic Processes in Queueing Theory1976