Isomorphism and symmetries in random phylogenetic trees

Journal of Applied Probability

Volumn 46, Issue 4, 2009, Pages 1005-1019

  Bóna, Miklós ^a   Flajolet, Philippe ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b INRIA ROCQUENCOURT   (France)

Author keywords

Analytic combinatorics; Combinatorial probability; Generating function; Isomorphism problem; Limit distributions; Nonplane tree; Phylogenies; Random tree; Singularity analysis; Symmetries and automorphisms

Indexed keywords

EID: 76449092755     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1261670685     Document Type: Article

References (22)

1. BENDER, E. A. (1973). Central and local limit theorems applied to asymptotic enumeration. J. Combinatorial Theory A 15, 91-111.
2. BÓNA, M. AND KNOPFMACHER, A. (2008). On the probability that certain compositions have the same number of parts. To appear in Ann. Combinatorics.
3. BROUTIN, N. AND FLAJOLET, P. (2008). The height of random binary unlabelled trees. In 5th Colloquium Math. Comput. Sci. (Blaubeuren, 2008), ed. U. Rösler, Discrete Math. Theoret. Comput. Sci. Proc. AI, Assoc. Discrete Math. Theoret. Comput. Sci., Nancy, pp. 121-134.
4. DIESTEL, R. (2000). Graph Theory (Graduate Texts Math. 173). Springer, New York.
5. ERDO′S, P. AND TURÁN, P. (1967). On some problems of a statistical group-theory. III. Acta Math. Acad. Sci. Hungar. 18, 309-320.
6. FINCH, S. R. (2003). Mathematical Constants. Cambridge University Press.
7. FLAJOLET, P. AND ODLYZKO, A. (1982). The average height of binary trees and other simple trees. J. Comput. System Sci. 25, 171-213.
8. FLAJOLET, P. AND SEDGEWICK, R. (2009). Analytic Combinatorics. Cambridge University Press.
9. FLAJOLET, P. et al. (2006). A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics. Electron. J. Combinatorics 13, 35pp.
10. GNEDENKO, B. V. AND KOLMOGOROV, A. N. (1968). Limit Distributions for Sums of Independent Random Variables. Addison-Wesley, Reading, MA.
11. GOH, W. M. Y. AND SCHMUTZ, E. (1991). The expected order of a random permutation. Bull. London Math. Soc. 23, 34-42.
12. HARARY, F. AND PALMER, E. M. (1973). Graphical Enumeration. Academic Press, New York.
13. HWANG, H.-K. (1998). On convergence rates in the central limit theorems for combinatorial structures. Europ. J. Combinatorics 19, 329-343.
14. MCKEON, K. A. (1991). The expected number of symmetries in locally-restricted trees. I. In Graph Theory, Combinatorics and Applications, Vol. 2, ed. Y. Alavi, Wiley, New York, pp. 849-860.
15. MCKEON, K. A. (1996). The expected number of symmetries in locally restricted trees. II. Discrete Appl. Math. 66, 245-253.
16. NICOLAS, J.-L. (1985). Distribution statistique de l'ordre d'un élément du groupe symétrique. Acta Math. Hung. 45, 69-84.
17. OTTER, R. (1948). The number of trees. Ann. Math. 49, 583-599.
18. PÓLYA, G. AND READ, R. C. (1987). Combinatorial Enumeration of Groups, Graphs and Chemical Compounds. Springer, New York.
19. SLOANE, N. J. A. (2008). The on-line encyclopedia of integer sequences. Available at www.research.att.com/-njas/sequences/.
20. STANLEY, R. P. (1999). Enumerative Combinatorics, Vol. II. Cambridge University Press.
21. VAN CUTSEM, B. AND YCART, B. (1998). Indexed dendrograms on random dissimilarities. J. Classification 15, 93-127.
22. WILF, H. S. (2005). The variance of the Stirling cycle numbers. Preprint. Available at http://arxiv.org/abs/math/0511428.