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 条
  • [41] CONVERGING MARKOV DECISION PROCESSES WITH MULTIPLICATIVE REWARD SYSTEM
    Fujita T.
    Bulletin of the Kyushu Institute of Technology - Pure and Applied Mathematics, 2023, 2023 (70): : 33 - 41
  • [42] The Lamperti representation of real-valued self-similar Markov processes
    Chaumont, Loic
    Panti, Henry
    Rivero, Victor
    BERNOULLI, 2013, 19 (5B) : 2494 - 2523
  • [43] Consistency of Maximum Likelihood Parameter Estimation for Bivariate Markov Chains
    Ephraim, Y.
    Mark, B. L.
    STOCHASTIC MODELS, 2013, 29 (01) : 89 - 111
  • [44] An EM algorithm for continuous-time bivariate Markov chains
    Mark, Brian L.
    Ephraim, Yariv
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2013, 57 (01) : 504 - 517
  • [45] Markov models—Markov chains
    Jasleen K. Grewal
    Martin Krzywinski
    Naomi Altman
    Nature Methods, 2019, 16 : 663 - 664
  • [46] ON TRANSIENT MARKOV-CHAINS WITH APPLICATION TO THE UNIQUENESS PROBLEM FOR MARKOV-PROCESSES
    BREIMAN, L
    ANNALS OF MATHEMATICAL STATISTICS, 1957, 28 (02): : 499 - 503
  • [47] Markov and Semi-Markov Chains, Processes, Systems, and Emerging Related Fields
    Vassiliou, P. -C. G.
    Georgiou, Andreas C.
    MATHEMATICS, 2021, 9 (19)
  • [48] Simulation of semi-Markov processes and Markov chains ordered in level crossing
    Ferreira, F
    Pacheco, A
    2005 NEXT GENERATION INTERNET NETWORKS, 2005, : 121 - 128
  • [49] RELATION BETWEEN IMBEDDED MARKOV-CHAINS IN PIECEWISE MARKOV-PROCESSES
    ROLSKI, T
    BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1977, 25 (02): : 181 - 189
  • [50] Using Semi-Markov Chains to Solve Semi-Markov Processes
    Bei Wu
    Brenda Ivette Garcia Maya
    Nikolaos Limnios
    Methodology and Computing in Applied Probability, 2021, 23 : 1419 - 1431