The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees

Random Structures and Algorithms

Volumn 25, Issue 2, 2004, Pages 179-207

  Panholzer, Alois ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (22)

1. D. Aldous, "The continuum random tree II: an overview," Stochastic analysis (Proceedings, Durham, 1990), London Math. Soc. Lecture Note Ser. 167, 23-70. Cambridge University Press, Cambridge, 1991.
2. R. Dobrow, On the distribution of distances in recursive trees, J Appl Probab 33 (1996), 749-757.
3. M. Drmota, The height distribution of leaves in rooted trees, Discrete Math Appl 4 (1994), 45-58.
4. M. Fisz, Probability theory and mathematical statistics, Wiley, New York, 1963.
5. Ph. Flajolet and A. Odlyzko, The average height of binary trees and other simple trees, Journal of Computer and System Sciences 25 (1982), 171-213.
6. Ph. Flajolet and A. Odlyzko, Singularity analysis of generating functions, SIAM J Discrete Math 3 (1990), 216-240.
7. Ph. Flajolet, T. Ottmann, and D. Wood, Search trees and bubble memories, RAIRO Theoret Inform 19 (1985), 137-164.
8. Ph. Flajolet and R. Sedgewick, An introduction to the analysis of algorithms, Addison-Wesley, Reading, MA, 1996.
9. H.-K. Hwang, On convergence rates in the central limit theorems for combinatorial structures, European J Combin 19 (1998), 329-343.
10. S. Janson, The Wiener index of simply generated random trees, Random Structures Algorithms 22 (2003), 337-358.
11. E. Kamke, Differentialgleichungen, Vol. 1, 10th edition, Teubner, Stuttgart, 1983.
12. R. Kemp, The expected additive weight of trees, Acta Inform 26 (1989), 711-740.
13. H. Mahmoud, Limiting distributions for path lengths in recursive trees, Probab Engrg Inform Sci 5 (1991), 53-59.
14. H. Mahmoud, Evolution of random search trees, Wiley, New York, 1992.
15. H. Mahmoud and R. Neininger, Distribution of distances in random binary search trees, Ann Appl Probab 13 (2003), 253-276.
16. H. Mahmoud and R. Smythe, A survey of recursive trees, Theoret Probab Math Statist 51 (1995), 1-37.
17. A. Meir and J. W. Moon, The distance between points in random trees, J Combin Theory 8 (1970), 99-103.
18. A. Meir and J. W. Moon, On the altitude of nodes in random trees, Canad J Math 30 (1978), 997-1015.
19. R. Neininger, The Wiener index of random trees, Combin Probab Comput 11 (2002), 587-597.
20. A. Panholzer and H. Prodinger, Spanning tree size in random binary search trees, Ann Appl Probab 14 (2004), 718-733.
21. J. Vitter and Ph. Flajolet, "Average case analysis of algorithms and data structures," Handbook of theoretical computer science, J. van Leeuwen (Editor), Elsevier, Amsterdam, 1990, pp. 431-524.
22. E. Whittaker and G. Watson, A course of modern analysis, 4th edition, Cambridge University Press, Cambridge, 1927.