Open Access
November 2011 Self-similar scaling limits of non-increasing Markov chains
Bénédicte Haas, Grégory Miermont
Bernoulli 17(4): 1217-1247 (November 2011). DOI: 10.3150/10-BEJ312

Abstract

We study scaling limits of non-increasing Markov chains with values in the set of non-negative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We show that the chain starting from $n$ and appropriately rescaled, converges in distribution, as $n → ∞$, to a non-increasing self-similar Markov process. This convergence holds jointly with that of the rescaled absorption time to the time at which the self-similar Markov process reaches first 0.

We discuss various applications to the study of random walks with a barrier, of the number of collisions in $Λ$-coalescents that do not descend from infinity and of non-consistent regenerative compositions. Further applications to the scaling limits of Markov branching trees are developed in our paper, Scaling limits of Markov branching trees, with applications to Galton–Watson and random unordered trees (2010).

Citation

Download Citation

Bénédicte Haas. Grégory Miermont. "Self-similar scaling limits of non-increasing Markov chains." Bernoulli 17 (4) 1217 - 1247, November 2011. https://doi.org/10.3150/10-BEJ312

Information

Published: November 2011
First available in Project Euclid: 4 November 2011

zbMATH: 1263.92034
MathSciNet: MR2854770
Digital Object Identifier: 10.3150/10-BEJ312

Keywords: Absorption time , random walks with a barrier , regenerative compositions , regular variation , Self-similar Markov processes , Λ-coalescents

Rights: Copyright © 2011 Bernoulli Society for Mathematical Statistics and Probability

Vol.17 • No. 4 • November 2011
Back to Top