Bernoulli

On the number of collisions in beta(2, b)-coalescents

Alex Iksanov, Alex Marynych, and Martin Möhle
Source: Bernoulli Volume 15, Number 3 (2009), 829-845.

Abstract

Expansions are provided for the moments of the number of collisions Xn in the β(2, b)-coalescent restricted to the set {1, …, n}. We verify that $X_{n}/\mathbb{E}X_{n}$ converges almost surely to one and that Xn, properly normalized, weakly converges to the standard normal law. These results complement previously known facts concerning the number of collisions in β(a, b)-coalescents with a∈(0, 2) and b=1, and a>2 and b>0. The case a=2 is a kind of ‘border situation’ which seems not to be amenable to approaches used for a≠2.

First Page: Show Hide
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.bj/1251463283
Digital Object Identifier: doi:10.3150/09-BEJ192
Zentralblatt MATH identifier: 05815957
Mathematical Reviews number (MathSciNet): MR2555201

References

[1] Abramowitz, M. and Stegun, I. (1964). Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. New York: Dover.
[2] Delmas, J.-F., Dhersin, J.-S. and Siri-Jegousse, A. (2008). Asymptotic results on the length of coalescent trees. Ann. Appl. Probab. 18 997–1025.
Mathematical Reviews (MathSciNet): MR2418236
Zentralblatt MATH: 1141.60007
Digital Object Identifier: doi:10.1214/07-AAP476
Project Euclid: euclid.aoap/1211819792
[3] Drmota, M., Iksanov, A., Moehle, M. and Roesler, U. (2007). Asymptotic results concerning the total branch length of the Bolthausen–Sznitman coalescent. Stochastic Process. Appl. 117 1404–1421.
[4] 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.
Mathematical Reviews (MathSciNet): MR2504401
[5] Gnedin, A., Hansen, B. and Pitman, J. (2007). Notes on the occupancy problem with infinitely many boxes: General asymptotics and power laws. Probab. Surv. 4 146–171.
Mathematical Reviews (MathSciNet): MR2318403
Zentralblatt MATH: 1189.60050
Digital Object Identifier: doi:10.1214/07-PS092
Project Euclid: euclid.ps/1180728778
[6] Gnedin, A., Iksanov, A. and Möhle, M. (2008). On asymptotics of exchangeable coalescents with multiple collisions. J. Appl. Probab. 45 1186–1195.
Mathematical Reviews (MathSciNet): MR2484170
Zentralblatt MATH: 1159.60016
Digital Object Identifier: doi:10.1239/jap/1231340242
Project Euclid: euclid.jap/1231340242
[7] Gnedin, A., Pitman, J. and Yor, M. (2006). Asymptotic laws for regenerative compositions: Gamma subordinators and the like. Probab. Theory Related Fields 135 576–602.
Mathematical Reviews (MathSciNet): MR2240701
Zentralblatt MATH: 1099.60023
Digital Object Identifier: doi:10.1007/s00440-005-0473-0
[8] Gnedin, A. and Yakubovich, Y. (2007). On the number of collisions in Λ-coalescents. Electron. J. Probab. 12 1547–1567.
Mathematical Reviews (MathSciNet): MR2365877
Zentralblatt MATH: 1190.60061
[9] 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. Comm. Probab. 12 28–35.
[10] Iksanov, A. and Möhle, M. (2008). On the number of jumps of random walks with a barrier. Adv. Appl. Probab. 40 206–228.
Mathematical Reviews (MathSciNet): MR2411821
Zentralblatt MATH: 1157.60041
Digital Object Identifier: doi:10.1239/aap/1208358893
Project Euclid: euclid.aap/1208358893
[11] Karlin, S. (1967). Central limit theorems for certain infinite urn schemes. J. Math. Mech. 17 373–401.
Mathematical Reviews (MathSciNet): MR216548
Zentralblatt MATH: 0154.43701
[12] Kingman, J.F.C. (1978). The representation of partition structures. J. London Math. Soc. (2) 18 374–380.
Mathematical Reviews (MathSciNet): MR509954
Zentralblatt MATH: 0415.92009
Digital Object Identifier: doi:10.1112/jlms/s2-18.2.374
[13] Neininger, R. and Rüschendorf, L. (2004). On the contraction method with degenerate limit equation. Ann. Probab. 32 2838–2856.
[14] Panholzer, A. (2004). Destruction of recursive trees. In: Mathematics and Computer Science III 267–280. Basel: Birkhäuser.
Mathematical Reviews (MathSciNet): MR2090518
Zentralblatt MATH: 1060.05022
Digital Object Identifier: doi:10.1007/978-3-0348-7915-6_29
[15] Pitman, J. (1999). Coalescents with multiple collisions. Ann. Probab. 27 1870–1902.
Mathematical Reviews (MathSciNet): MR1742892
Zentralblatt MATH: 0963.60079
Digital Object Identifier: doi:10.1214/aop/1022677552
Project Euclid: euclid.aop/1022874819
[16] Pratt, J.W. (1960). On interchanging limits and integrals. Ann. Math. Statist. 31 74–77.
Mathematical Reviews (MathSciNet): MR123673
Zentralblatt MATH: 0090.26802
Digital Object Identifier: doi:10.1214/aoms/1177705988
Project Euclid: euclid.aoms/1177705988
[17] Sagitov, S. (1999). The general coalescent with asynchronous mergers of ancestral lines. J. Appl. Probab. 36 1116–1125.
Mathematical Reviews (MathSciNet): MR1742154
Zentralblatt MATH: 0962.92026
Digital Object Identifier: doi:10.1239/jap/1032374759
Project Euclid: euclid.jap/1032374759

2012 © Bernoulli Society for Mathematical Statistics and Probability

Bernoulli

Bernoulli

Turn MathJax Off
What is MathJax?