Coalescents with Simultaneous Multiple Collisions
Abstract
We study a family of coalescent processes that undergo ``simultaneous multiple collisions,'' meaning that many clusters of particles can merge into a single cluster at one time, and many such mergers can occur simultaneously. This family of processes, which we obtain from simple assumptions about the rates of different types of mergers, essentially coincides with a family of processes that Mohle and Sagitov obtain as a limit of scaled ancestral processes in a population model with exchangeable family sizes. We characterize the possible merger rates in terms of a single measure, show how these coalescents can be constructed from a Poisson process, and discuss some basic properties of these processes. This work generalizes some work of Pitman, who provides similar analysis for a family of coalescent processes in which many clusters can coalesce into a single cluster, but almost surely no two such mergers occur simultaneously.
Full Text: Download PDF | View PDF online (requires PDF plugin)
Pages: 1-50
Publication Date: July 10, 2000
DOI: 10.1214/EJP.v5-68
References
- Aldous, D. J. (1985) Exchangeability and related topics. In P. L. Hennequin, editor, École d'Été de Probabilités de Saint-Flour XIII, Lecture Notes in Mathematics, Vol. 1117. Springer-Verlag. Math. Review 88d:60107
- Bertoin, J. (1996) Lévy Processes. Cambridge University Press. Math. Review 98e:60117
- Bolthausen, E. and Sznitman, A.-S. (1998), On Ruelle's probability cascades and an abstract cavity method. Comm. Math. Phys. 197, no. 2, 247-276. Math. Review 99k:60244
- Doob, J. L. Measure Theory. (1994) Springer-Verlag, New York. Math. Review 95c:28001
- Durrett, R. (1996) Probability: Theory and Examples. 2nd. ed. Duxbury Press, Belmont, CA. Math. Review 91m:60002
- Ethier, S. N. and Kurtz, T. G. (1986) Markov Processes: Characterization and Convergence. Wiley, New York. Math. Review 88a:60130
- Fristedt, B. and Gray, L. (1997) A Modern Approach to Probability Theory. Birkhäuser, Boston. Math. Review 98e:60002
- Johnson, N. L. and Kotz, S. (1969) Discrete Distributions. Wiley, New York. Math. Review 42#3893
- Kingman, J. F. C. (1978) The representation of partition structures. J. London Math. Soc. 18, no. 2, 374-380. Math. Review 80a:05018
- Kingman, J. F. C. (1982) The coalescent. Stochastic Process. Appl. 13, no. 3, 235-248. Math. Review 84a:60079
- Kingman, J. F. C. (1982) On the genealogy of large populations. In J. Gani and E. J. Hannan, editors, Essays in Statistical Science, Papers in honour of P. A. P. Moran, J. Appl. Prob. Special Volume 19A, pages 27-43. Math. Review 83d:92043
- Möhle, M. and Sagitov, S. (1998) A characterization of ancestral limit processes arising in haploid population genetics models. Berichte zur Stochastik und verwandten Gebieten, Johannes Gutenberg-Universität Mainz. (preprint) Math. Review number not available.
- Möhle, M. and Sagitov, S. (1999) A classification of coalescent processes for haploid exchangeable population models. (preprint) Math. Review number not available.
- Mohle, M. and Sagitov, S. (1999) Coalescent patterns in exchangeable diploid population models. Berichte zur Stochastik und verwandten Gebieten, Johannes Gutenberg-Universität Mainz. (preprint) Math. Review number not available.
- Pitman, J. (1995) Exchangeable and partially exchangeable random partitions. Probab. Theory Related Fields. 102, no. 2, 145-158. Math. Review 96e:60059
- Pitman, J. (1999) Coalescents with multiple collisions. Ann. Probab. 27, no. 4, 1870-1902. Math. Review 1742892
- Revuz, D. and Yor, M. (1999) Continuous Martingales and Brownian Motion. 3rd. ed. Springer-Verlag, Berlin. Math. Review 2000h:60050
- Sagitov, S. (1999) The general coalescent with asynchronous mergers of ancestral lines. J. Appl. Probab. 36, no. 4, 1116-1125. Math. Review 1742154
- Schweinsberg, J. (2000) A necessary and sufficient condition for the $Lambda$-coalescent to come down from infinity. Electron. Comm. Probab. 5:1, 1-11. Math. Review 1736720
This work is licensed under a Creative Commons Attribution 3.0 License.