The Wiener Index of Simply Generated Random Trees

Random Structures and Algorithms

Volumn 22, Issue 4, 2003, Pages 337-358

  Janson, Svante ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Random trees; Wiener Index

Indexed keywords

EID: 0038095487     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10074     Document Type: Article

References (31)

1. D. Aldous, Asymptotic fringe distributions for general families of random trees, Ann Appl Probab 1(2) (1991), 228-266.
2. D. Aldous, The continuum random tree II: An overview, Stochastic analysis, Proc Durham, 1990. 23-70. Lond Math Soc Lecture Note Ser 167, Cambridge University Press, Cambridge, 1991.
3. D. Aldous, The continuum random tree II: An overview, Stochastic analysis, Proc Durham, 1990. 23-70. Lond Math Soc Lecture Note Ser 167, Cambridge University Press, Cambridge, 1991.
4. D. Aldous, The continuum random tree III, Ann Probab 21(1) (1993), 248-289.
5. D. Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent, Ann Probab 25(2) (1997), 812-854.
6. G. N. Bagaev and E. F. Dmitriev, Enumeration of connected labeled bipartite graphs, Dokl Akad Nauk BSSR 28(12) (1984), 1061-1063, 1148 (in Russian).
7. E. A. Bender, E. R. Canfield, and B. D. McKay, The asymptotic number of labeled connected graphs with a given number of vertices and edges, Random Struct Alg 1(2) (1990), 127-169.
8. L. Devroye, Branching processes and their applications in the analysis of tree structures and tree algorithms, Probabilistic methods for algorithmic discrete mathematics, Eds. M. Habib et al., 249-314. Algorithms Combin 16, Springer-Verlag, Berlin, 1998.
9. A. A. Dobrynin, R. Entringer, and I. Gutman, Wiener index of trees: Theory and applications, Acta Appl Math 66(3) (2001), 211-249.
10. M. Drmota and J.-F. Marckert, Reinforced weak convergence of stochastic processes, preprint, 2001, available from http://www.geometric.tuwien.ac.at/drmota/.
11. R. C. Entringer, A. Meir, J. W. Moon, and L. A. Székely, The Wiener index of trees from certain families, Australas J Combin 10 (1994), 211-224.
12. P. Flajolet and A. Odlyzko, The average height of binary trees and other simple trees, J Comput Syst Sci 25 (1982), 171-213.
13. P. Flajolet, Z. Gao, A. Odlyzko, and B. Richmond, The distribution of heights of binary trees and other simple trees, Combinat Probab Comput 2 (1993), 145-156.
14. P. Flajolet, P. Poblete, and A. Viola, On the analysis of linear probing hashing, Algorithmica 22(4) (1998), 490-515.
15. S. Janson, D. E. Knuth, T. Łuczak, and B. Pittel, The birth of the giant component, Random Struct Alg 4(3) (1993), 233-358.
16. D. E. Knuth, The art of computer programming. Volume 1: Fundamental algorithms, 3rd edition, Addison-Wesley, Reading, MA, 1997.
17. V. F. Kolchin, Random mappings, Nauka, Moscow, 1984 (Russian) [Engl transl: Optimization Software, New York, 1986].
18. V. F. Kolchin, Random mappings, Nauka, Moscow, 1984 (Russian) [Engl transl: Optimization Software, New York, 1986].
19. P. Lévy, Processus stochastiques et mouvement brownien, Gauthier-Villars, Paris, 1948.
20. G. Louchard, Kac's formula, Lévy's local time and Brownian excursion, J Appl Probab 21(3) (1984), 479-499.
21. G. Louchard, The Brownian excursion area: A numerical analysis, Comput Math Appl 10(6) (1984), 413-417; Erratum: Comput Math Appl Part A 12(3) (1986), 375.
22. J.-F. Marckert and A. Mokkadem, The depth first processes of Galton-Watson trees converge to the same Brownian excursion, preprint, 2001, available from http://www.math.uvsq.fr/̃marckert/.
23. A. Meir and J. W. Moon, On the altitude of nodes in random trees, Can J Math 30 (1978), 997-1015.
24. R. Neininger, Wiener index of random trees, preprint, 2001, available from http://www. stochastik.uni-freiburg.de/homepages/neininger/.
25. J. Spencer, Enumerating graphs and Brownian motion, Commun Pure Appl Math 50 (1997), 291-294.
26. L. Takács, Conditional limit theorems for branching processes, J Appl Math Stochastic Anal 4(4) (1991), 263-292.
27. L. Takács, The asymptotic distribution of the total heights of random rooted trees, Acta Sci Math (szeged) 57(1-4) (1993), 613-625.
28. V. A. Voblyǐ, Wright and Stepanov-Wright coefficients, Mat Zametki 42(6) (1987), 854-862, 911 [Engl transl: Math Notes 42 (1987), 969-974].
29. V. A. Voblyǐ, Wright and Stepanov-Wright coefficients, Mat Zametki 42(6) (1987), 854-862, 911 [Engl transl: Math Notes 42 (1987), 969-974].
30. H. Wiener, Structural determination of paraffin boiling points, J Am Chem Soc 69 (1947), 17-20.
31. E. M. Wright, The number of connected sparsely edged graphs, J Graph Theory 1 (1977), 317-330.