On asymptotics of exchangeable coalescents with multiple collisions

Journal of Applied Probability

Volumn 45, Issue 4, 2008, Pages 1186-1195

  Gnedin, Alexander ^a   Iksanov, Alex ^b   Möhle, Martin ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b TARAS SHEVCHENKO NATIONAL UNIVERSITY OF KYIV   (Ukraine)

^c HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

Absorption time; Coupling; Exchangeable coalescent; External branch length; Multiple collisions; Number of collisions; Regenerative composition

Indexed keywords

EID: 58449107332     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1231340242     Document Type: Article

References (25)

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.
2. BERESTYCKI, J., BERESTYCKI, N. AND SCHWEINSBERG, J. (2008). Small time properties of beta coalescents. Ann. Inst. H. Poincaré Prob. Statist. 44, 214-238.
3. BERTOIN, J. (2006). Random Fragmentation and Coagulation Processes. Cambridge University Press.
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.
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.
6. DRMOTA, M., IRSANOV, 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.
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.
8. FREUND, R 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.
9. GNEDIN, A.V. (2004). The Bernoulli sieve. Bernoulli 10, 79-96.
10. GNEDIN, A. AND PITMAN, J. (2005). Regenerative composition structures. Ann. Prob. 33, 445-479.
11. GNEDIN, A. AND YAKUBOVICH, Y. (2007). On the number of collisions in Λ-coalescents. Electron. J. Prob. 12, 1547-1567.
12. GNEDIN, A., DONG, R. AND PITMAN, J. (2007). Exchangeable partitions derived from Markovian coalescents. Ann. Appl. Prob. 17, 1172-1201.
13. GNEDIN, A., IKSANOV, A. AND ROESLER, U. (2008). Small parts in the Bernoulli sieve. Discrete Math. Theoret. Computer Sci. AI, 239-246.
14. GNEDIN, A., PITMAN, J. AND YOR, M. (2006). Asymptotic laws for compositions derived from transformed subordinators. Ann. Prob. 34, 468-492.
15. GNEDIN, A., PITMAN, J. AND YOR, M. (2006). Asymptotic laws for regenerative compositions: gamma subordinates and the like. Prob. Theory Relat. Fields 135, 576-602.
16. GNEDIN, A., IRSANOV, A., NEGADAJLOV, P. AND ROESLER, U. (2008). The Bernoulli sieve revisited. Preprint. Available at http://arx.iv.org/abs/0801.4725.
17. GONCHAROV, V. L. (1962). On the field of combinatorial analysis. Amer. Math. Soc. Trans. Ser. 2, 19, 1-46.
18. IRSANOV, A. AND MÖHLE, M. (2008). On the number of jumps of random, walks with a barrier. Adv. Appl. Prob. 40, 206-228.
19. IRSANOV, A. AND TERLETSKY, YU. (2008). On asymptotic behavior of certain recursions with random indices of linear growth. Prob. Stat. Forum 1, 62-67.
20. IRSANOV, A., MARYNYCH, A. AND MÖHLE, M. (2007). On the number of collisions in beta(2,b)-coalescents. Submitted.
21. PANHOLZER, A. (2004). Destruction of recursive trees. In Mathematics and Computer Science III, Birkhäuser, Basel, pp. 267-280.
22. PITMAN, J. (1999). Coalescents with multiple collisions. Ann. Prob. 27, 1870-1902.
23. PITMAN, J. (2006). Combinatorial Stochastic Processes (Lecture Notes Math. 1875). Springer, Berlin.
24. ROSS, S. M. (1982). A simple heuristic approach to simplex efficiency. Europ. J. Operat. Res. 9, 344-346.
25. SAGITOV, S. (1999). The general coalescent with asynchronous mergers of ancestral lines. J. Appl. Prob. 36, 1116-1125.