Self-similar scaling limits of non-increasing Markov chains

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published in at http://dx.doi.org/10.3150/10-BEJ312 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statisti

Scientific paper

10.3150/10-BEJ312

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\rightarrow \infty$, 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 $\Lambda$-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).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Self-similar scaling limits of non-increasing Markov chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-similar scaling limits of non-increasing Markov chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-similar scaling limits of non-increasing Markov chains will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-432737

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.