Bivariate Markov chains converging to Lamperti transform Markov additive processes

被引:1
|
作者
Haas, Benedicte [1 ]
Stephenson, Robin [2 ]
机构
[1] Sorbonne Paris Cite, Univ Paris 13, CNRS, LAGA,UMR 7539, F-93430 Villetaneuse, France
[2] NYU, ECNU Inst Math Sci, Shanghai, Peoples R China
关键词
SIMILAR SCALING LIMITS; MULTIPLE COLLISIONS; COALESCENTS; TREES; FRAGMENTATIONS; ASYMPTOTICS; MODELS; NUMBER; TIME;
D O I
10.1016/j.spa.2017.11.008
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Motivated by various applications, we describe the scaling limits of bivariate Markov chains (X, J) on Z(+) x {1, ..., kappa} where X can be viewed as a position marginal and {1, ..., kappa} is a set of K types. The chain starts from an initial value (n, i) is an element of Z(+) x {1, ..., kappa} with i fixed and n -> infinity, 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 (2011) and Bertoin and Kortchemski (2016) 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. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:3558 / 3605
页数:48
相关论文
共 50 条