Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 148 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 183 tok/s Pro
GPT OSS 120B 443 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Bivariate Markov chains converging to Lamperti transform Markov Additive Processes (1612.06058v1)

Published 19 Dec 2016 in math.PR

Abstract: Motivated by various applications, we describe the scaling limits of bivariate Markov chains $(X,J)$ on $\mathbb Z_+ \times {1,\ldots,\kappa}$ where $X$ can be viewed as a position marginal and ${1,\ldots,\kappa}$ is a set of $\kappa$ types. The chain starts from an initial value $(n,i)\in \mathbb Z_+ \times {1,\ldots,\kappa}$, with $i$ fixed and $n \rightarrow \infty$, and typically we will assume that the macroscopic jumps of the marginal $X$ are rare, i.e. arrive with a probability proportional to a negative power of the current state. We also assume that $X$ is non-increasing. We then observe different asymptotic regimes according to whether the rate of type change is proportional to, faster than, or slower than the macroscopic jump rate. In these different situations, we obtain in the scaling limit Lamperti transforms of Markov additive processes, that sometimes reduce to standard positive self-similar Markov processes. As first examples of applications, we study the number of collisions in coalescents in varying environment and the scaling limits of Markov random walks with a barrier. This completes previous results obtained by Haas and Miermont as well as Bertoin and Kortchemski in the monotype setting. In a companion paper, we will use these results as a building block to study the scaling limits of multi-type Markov branching trees, with applications to growing models of random trees and multi-type Galton-Watson trees.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.