Hostname: page-component-7dd5485656-jtdwj Total loading time: 0 Render date: 2025-10-31T06:52:55.105Z Has data issue: false hasContentIssue false
  • English
  • Français

On Λ-Coalescents with Dust Component

Part of: Limit theorems Special processes Markov processes Combinatorial probability Stochastic processes

Published online by Cambridge University Press:  14 July 2016

Alexander Gnedin ,
Alexander Iksanov  and
Alexander Marynych
Alexander Gnedin*
Affiliation:
Utrecht University
Alexander Iksanov*
Affiliation:
National Taras Shevchenko University of Kiev
Alexander Marynych*
Affiliation:
National Taras Shevchenko University of Kiev
*
∗ Postal address: Department of Mathematics, Utrecht University, Postbus 80010, 3508 TA Utrecht, The Netherlands. Email address: a.v.gnedin@uu.nl
∗∗ Postal address: Faculty of Cybernetics, National Taras Shevchenko University of Kiev, 01033 Kiev, Ukraine.
∗∗ Postal address: Faculty of Cybernetics, National Taras Shevchenko University of Kiev, 01033 Kiev, Ukraine.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider the Λ-coalescent processes with a positive frequency of singleton clusters. The class in focus covers, for instance, the beta(a, b)-coalescents with a > 1. We show that some large-sample properties of these processes can be derived by coupling the coalescent with an increasing Lévy process (subordinator), and by exploiting parallels with the theory of regenerative composition structures. In particular, we discuss the limit distributions of the absorption time and the number of collisions.

Keywords

Absorption timecouplingΛ-coalescentnumber of collisionsregenerative composition structuresubordinator

MSC classification

Secondary: 60C05: Combinatorial probability 60G09: Exchangeability 60F05: Central limit and other weak theorems 60J10: Markov chains (discrete-time Markov processes on discrete state spaces) 60K05: Renewal theory

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 48 , Issue 4 , December 2011 , pp. 1133 - 1151
Copyright
Copyright © Applied Probability Trust 2011 

References

[1] Barbour, A. D. and Gnedin, A. V. (2006). Regenerative compositions in the case of slow variation. Stoch. Process. Appl. 116, 1012–1047.Google Scholar
[2] Berestycki, N. (2009). Recent Progress in Coalescent Theory (Ensaios Matemáticos 16). Sociedade Brasileira de Matemática, Rio de Janeiro.Google Scholar
[3] Bertoin, J. (1996). Subordinators: Examples and Applications (Lecture Notes Math. 1727). Springer, Berlin.Google Scholar
[4] Bertoin, J. (2010). Exchangeable coalescents. Lecture Notes, ETH Zürich. Available at http://www.fim.math. ethz.ch/lectures/Lectures_Bertoin.pdf.Google Scholar
[5] Bingham, N. H. (1972). Limit theorems for regenerative phenomena, recurrent events and renewal theory. Z. Wahrscheinlichkeitsth. 21, 20–44.Google Scholar
[6] Bingham, N.H., Goldie, C.M. and Teugels, J. L. (1989). Regular Variation. Cambridge University Press.Google Scholar
[7] Drmota, M., Iksanov, A., Moehle, M. and Roesler, U. (2009). A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. Random Structures Algorithms 34, 319–336.Google Scholar
[8] Durrett, R. and Liggett, T. M. (1983). Fixed points of the smoothing transformation. Z. Wahrscheinlichkeitsth. 64, 275–301.Google Scholar
[9] Freund, F. and Möhle, M. (2009). On the time back to the most recent common ancestor and the external branch length of the Bolthausen–Sznitman coalescent. Markov Process. Relat. Fields 15, 387–416.Google Scholar
[10] Gnedin, A. and Pitman, J. (2005). Regenerative composition structures. Ann. Prob. 33, 445–479.Google Scholar
[11] Gnedin, A. and Yakubovich, Y. (2007). On the number of collisions in Λ-coalescents. Electron. J. Prob. 12, 1547–1567.Google Scholar
[12] Gnedin, A., Iksanov, A. and Marynych, A. (2010). Limit theorems for the number of occupied boxes in the Bernoulli sieve. Theory Stoch. Process. 16, 44–57.Google Scholar
[13] Gnedin, A., Iksanov, A. and Möhle, M. (2008). On asymptotics of exchangeable coalescents with multiple collisions. J. Appl. Prob. 45, 1186–1195.Google Scholar
[14] Gnedin, A., Iksanov, A. and Roesler, U. (2008). Small parts in the Bernoulli sieve. Discrete Math. Theoret. Comput. Sci. AI, 235–242.Google Scholar
[15] Gnedin, A., Pitman, J. and Yor, M. (2006). Asymptotic laws for compositions derived from transformed subordinators. Ann. Prob. 34, 468–492.Google Scholar
[16] Gnedin, A., Pitman, J. and Yor, M. (2006). Asymptotic laws for regenerative compositions: gamma subordinators and the like. Prob. Theory Relat. Fields 135, 576–602.Google Scholar
[17] Goldschmidt, C. and Martin, J. B. (2005). Random recursive trees and the Bolthausen–Sznitman coalescent. Electron. J. Prob. 10, 718–745.Google Scholar
[18] Haas, B. and Miermont, G. (2011). Self-similar scaling limits of non-increasing Markov chains. To appear in Bernoulli.Google Scholar
[19] Iksanov, A. and Möhle, M. (2007). A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree. Electron. Commun. Prob. 12, 28–35.Google Scholar
[20] Iksanov, A. and Möhle, M. (2008). On the number of Jumps of random walks with a barrier. Adv. Appl. Prob. 40, 206–228.Google Scholar
[21] Iksanov, A., Marynych, A. and Möhle, M. (2009). On the number of collisions in beta(2, b)-coalescents. Bernoulli 15, 829–845.Google Scholar
[22] Möhle, M. (2010). Asymptotic results for coalescent processes without proper frequencies and applications to the two-parameter Poisson-Dirichlet coalescent. Stoch. Process. Appl. 120, 2159–2173 Google Scholar
[23] Negadailov, P. (2010). Limit theorems for random recurrences and renewal-type processes. , Utrecht University. Available at http://igitur-archive.library.uu.nl/dissertations/.Google Scholar
[24] Pitman, J. (1999). Coalescents with multiple collisions. Ann. Prob. 27, 1870–1902.Google Scholar
[25] Pitman, J. (2006). Combinatorial Stochastic Processes (Lecture Notes Math. 1875). Springer, Berlin.Google Scholar
[26] Sagitov, S. (1999). The general coalescent with asynchronous mergers of ancestral lines. J. Appl. Prob. 36, 1116–1125.Google Scholar
[27] Schweinsberg, J. (2000). A necessary and sufficient condition for the Λ-coalescent to come down from infinity. Electron. Commun. Prob. 5, 1–11.Google Scholar