Expected coalescence time for a nonuniform allocation process

Advances in Applied Probability

Volumn 40, Issue 4, 2008, Pages 1002-1032

  Mcsweeney, John K ^a   Pittel, Boris G ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Asymptotic behavior; Coalescence; Generalized Wright Fisher model; Markov chain; Most recent common ancestor; Random function

Indexed keywords

ASYMPTOTIC ANALYSIS; BUBBLES (IN FLUIDS); MARKOV PROCESSES; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; SPHERES;

ASYMPTOTIC BEHAVIOR; GENERALIZED WRIGHT-FISHER MODEL; MARKOV CHAIN; MOST RECENT COMMON ANCESTOR; RANDOM FUNCTION;

COALESCENCE;

EID: 59649108584     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1231340162     Document Type: Article

References (20)

1. ADLER, I., AHN, H.-S., KARP, R. M. AND Ross, S. M. (2003). Coalescing times for iid random variables with applications to population biology. Random Structures Algorithms 23, 155-166.
2. DALAL, A. AND SCHMUTZ, E. (2002). Compositions of random Functions on a finite set. Electron J. Combinatorics 9, 7 pp.
3. DONNELLY, P. AND TAVARÉ, S. (1995). Coalescents and genealogical structure under neutrality. Ann. Rev. Genet. 29, 401-421.
4. FILL, J. (2002). On compositions of random functions on a finite set. Unpublished manuscript: Available at http://www.mts.jhu.edu/~fill/ papers/compositions.ps.
5. FRIEZE, A. M. AND GRIMMETT, G. R. (1985). The shortest-path problem for graphs with random arc-lengths. Discrete Appl. Math. 10, 57-77.
6. GOH, W., HITCZENKO, P. AND SCHMUTZ, E. (2006). Iterating random functions on a finite set. Unpublished manuscript. Available at http:// front.math.ucdavis.edu/0207.5276.
7. KINGMAN, J. F. C. (1982). Exchangeability and the evolution of large populations. In Exchangeability in Probability and Statistics, eds G. Koch and F. Spizzichino, North-Holland, Amsterdam, pp. 97-112.
8. KINGMAN, J. F. C. (1982). On the genealogy of large populations. In Essays in Statistical Science (J. Appl. Prob. Spec. Vol. 19A), eds J. Gani and E. J. Hannan, Applied Probability Trust, pp. 27-43.
9. KINGMAN, J. F. C. (198Z). The coalescent. Stoch. Process Appl. 13, 235-248.
10. KNUTH, D. E., MOTWANI, R. AND PITTEL, B. (1990). Stable husbands. Random Structures Algorithms 1, 1-14.
11. MITZENMACHER, M. AND UPFAL, E. (2005). Probability and Computing. Cambridge University Press.
12. MÖHLE, M. (1998). Robustness results for the coalescent. J. Appl. Prob. 35, 438-447.
13. MÖHLE, M. (2004). The time back to the most recent common ancestor in exchangeable population models. Adv. Appl. Prob. 36, 78-97.
14. MÖHLE, M. AND SAGITOV, S. (2001). A classification of coalescent processes for haploid exchangeable population models. Ann. Prob. 29, 1547-1562.
15. PITMAN, J. (1999). Coalescents with multiple collisions. Ann. Prob. 27, 1870-1902.
16. PITTEL, B. (1987). On spreading a rumor. SIAM J. Appl. Math. 47, 213-223.
17. PROPP, J. G. AND WILSON, D. B. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures Algorithms 9, 223-252.
18. PROPP, J. G. AND WILSON, D. B. (1998). How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. J. Algorithms 27, 170-217.
19. SAGITOV, S. (1999). The general coalescent with asynchronous mergers of ancestral lines. J. Appl. Prob., 36, 1116-1125.
20. SCHWEINSBERG, J. (2000). Coalescents with simultaneous multiple collisions. Electron. J. Prob. 5, 50 pp.