Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-26T18:42:22.852Z Has data issue: false hasContentIssue false
  • English
  • Français

On Asymptotics of Exchangeable Coalescents with Multiple Collisions

Part of: Combinatorial probability Stochastic processes Special processes

Published online by Cambridge University Press:  14 July 2016

Alexander Gnedin ,
Alex Iksanov  and
Martin Möhle
Alexander Gnedin*
Affiliation:
Utrecht University
Alex Iksanov*
Affiliation:
National Taras Shevchenko University of Kiev
Martin Möhle*
Affiliation:
University of Düsseldorf
*
∗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. Email address: iksan@unicyb.kiev.ua
∗∗∗Postal address: Mathematical Institute, University of Düsseldorf, Universitätsstrasse 1, 40225 Düsseldorf, Germany. Email address: moehle@math.uni-duesseldorf.de
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 study the number of collisions, Xn, of an exchangeable coalescent with multiple collisions (Λ-coalescent) which starts with n particles and is driven by rates determined by a finite characteristic measure η(dx) = x−2Λ(dx). Via a coupling technique, we derive limiting laws of Xn, using previous results on regenerative compositions derived from stick-breaking partitions of the unit interval. The possible limiting laws of Xn include normal, stable with index 1 ≤ α < 2, and Mittag-Leffler distributions. The results apply, in particular, to the case when η is a beta(a − 2, b) distribution with parameters a > 2 and b > 0. The approach taken allows us to derive asymptotics of three other functionals of the coalescent: the absorption time, the length of an external branch chosen at random from the n external branches, and the number of collision events that occur before the randomly selected external branch coalesces with one of its neighbours.

Keywords

Absorption timecouplingexchangeable coalescentexternal branch lengthmultiple collisionsnumber of collisionsregenerative composition

MSC classification

Secondary: 60G09: Exchangeability 60C05: Combinatorial probability 60K05: Renewal theory
Type
Research Article
Information
Journal of Applied Probability , Volume 45 , Issue 4 , December 2008 , pp. 1186 - 1195
Copyright
Copyright © Applied Probability Trust 2008 

References

[1] Bai, Z. D., Hwang, H. K. and Liang, W. Q. (1998). Normal approximations of the number of records in geometrically distributed random variables. Random Structures Algorithms 13, 319–334.Google Scholar
[2] Berestycki, J., Berestycki, N. and Schweinsberg, J. (2008). Small time properties of beta coalescents. Ann. Inst. H. Poincaré Prob. Statist. 44, 214–238.Google Scholar
[3] Bertoin, J. (2006). Random Fragmentation and Coagulation Processes. Cambridge University Press.Google Scholar
[4] Caliebe, A., Neininger, R., Krawczak, M. and Rösler, U. (2007). On the length distribution of external branches in coalescence trees: genetic diversity within species. Theoret. Pop. Biol. 72, 245–252.Google Scholar
[5] Delmas, J.-F., Dhersin, J.-S. and Siri-Jegousse, A. (2008). Asymptotic results on the length of coalescent trees. Ann. Appl. Prob. 18, 997–1025.Google Scholar
[6] Drmota, M., Iksanov, A., Möhle, M. and Rösler, U. (2007). Asymptotic results concerning the total branch length of the Bolthausen–Sznitman coalescent. Stoch. Process. Appl. 117, 1404–1421.Google Scholar
[7] Drmota, M., Iksanov, A., Möhle, M. and Rösler, U. (2009). A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. To appear in Random Structures Algorithms.Google Scholar
[8] Freund, F. and Möhle, M. (2007). On the time back to the most recent common ancestor and the external branch length of the Bolthausen–Sznitman coalescent. Submitted.Google Scholar
[9] Gnedin, A.V. (2004). The Bernoulli sieve. Bernoulli 10, 79–96.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., Dong, R. and Pitman, J. (2007). Exchangeable partitions derived from Markovian coalescents. Ann. Appl. Prob. 17, 1172–1201.Google Scholar
[13] Gnedin, A., Iksanov, A. and Roesler, U. (2008). Small parts in the Bernoulli sieve. Discrete Math. Theoret. Computer Sci. AI, 239–246.Google Scholar
[14] Gnedin, A., Pitman, J. and Yor, M. (2006). Asymptotic laws for compositions derived from transformed subordinators. Ann. Prob. 34, 468–492.Google Scholar
[15] 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
[16] Gnedin, A., Iksanov, A., Negadajlov, P. and Roesler, U. (2008). The Bernoulli sieve revisited. Preprint. Available at http://arxiv.org/abs/0801.4725.Google Scholar
[17] Goncharov, V. L. (1962). On the field of combinatorial analysis. Amer. Math. Soc. Trans. Ser. 2, 19, 1–46.Google Scholar
[18] 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
[19] Iksanov, A. and Terletsky, Yu. (2008). On asymptotic behavior of certain recursions with random indices of linear growth. Prob. Stat. Forum 1, 62–67.Google Scholar
[20] Iksanov, A., Marynych, A. and Möhle, M. (2007). On the number of collisions in beta(2,b)-coalescents. Submitted.Google Scholar
[21] Panholzer, A. (2004). Destruction of recursive trees. In Mathematics and Computer Science III, Birkhäuser, Basel, pp. 267–280.Google Scholar
[22] Pitman, J. (1999). Coalescents with multiple collisions. Ann. Prob. 27, 1870–1902.Google Scholar
[23] Pitman, J. (2006). Combinatorial Stochastic Processes (Lecture Notes Math. 1875). Springer, Berlin.Google Scholar
[24] Ross, S. M. (1982). A simple heuristic approach to simplex efficiency. Europ. J. Operat. Res. 9, 344–346.Google Scholar
[25] Sagitov, S. (1999). The general coalescent with asynchronous mergers of ancestral lines. J. Appl. Prob. 36, 1116–1125.Google Scholar