The height of increasing trees

Random Structures and Algorithms

Volumn 32, Issue 4, 2008, Pages 494-518

  Broutin, N ^a   Devroye, L ^a   McLeish, E ^a   De La Salle, M ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Branching process; Height; Increasing tree; Probabilistic analysis; Random tree

Indexed keywords

EID: 52349095614     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20202     Document Type: Article

References (48)

1. K. B. Athreya and P. E. Ney, Branching processes, Springer, Berlin, 1972.
2. A. L. Barabási and R. Albert, Emergence of scaling in random network, Science 286 (1999), 509-512.
3. F. Bergeron, P. Flajolet, and B. Salvy, Varieties of increasing trees, CAAP Lect Notes Comput Sci 581 (1992), 24-48.
4. J. D. Biggins, The first and last-birth problems in a multitype age-dependent branching process, Adv Appl Probab 8 (1976), 446-459.
5. J. D. Biggins, Chernoff's theorem in the branching random walk, J Appl Probab 14 (1977), 630-636.
6. J. D. Biggins and D. R. Grey, A note on the growth of random trees, Stat Probab Lett 32 (1997), 339-342.
7. P. Billingsley, Probability and Measure, 3rd edition, Wiley, New York, 1995.
8. N. Broutin and L. Devroye, Large deviations for the weighted height of an extended class of trees, Algorithmica 46 (2006), 271-297.
9. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann Math Stat 23 (1952), 493-507.
10. E. G. Coffman and J. Eve, File structures using hashing functions, Commun ACM 13 (1970), 427-436.
11. H. Cramér, Sur un nouveau théorème-limite de la théorie des probabilités. In, Colloque Consacré à la Théorie des Probabilités, volume 736, Hermann, Paris, 1938, pp. 5-23.
12. A. Dembo and O. Zeitouni, Large Deviation Techniques and Applications, 2nd edition, Springer Verlag, 1998.
13. J.-D. Deuschel and D. W. Stroock, Large Deviations, American Mathematical Society, Providence, RI, 1989.
14. L. Devroye, A note on the height of binary search trees, J ACM 33 (1986), 489-498.
15. L. Devroye, Branching processes in the analysis of the heights of trees, Acta Inform 24 (1987), 277-298.
16. L. Devroye, Branching processes and their application in the analysis of tree structures and tree algorithms, In, M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic methods for algorithmic discrete mathematics, volume 16 of Springer series on algorithms and combinatorics, Springer, Berlin, 1998, pp. 249-314.
17. L. Devroye, Universal limit laws for depth in random trees, SIAM J Comp 28 (1998), 409-432.
18. M. Drmota, An analytic approach to the height of binary search trees II, J ACM 50 (2003), 333-374.
19. M. Drmota, The height of increasing trees, 2006. Annals of Combinatorics, to appear.
20. M. Evans, N. A. J. Hastings, and J. B. Peacock, Statistical Distributions, 3rd edition, Wiley, New York, NY, 2000.
21. E. Fredkin, Trie memory, Commun ACM, 3 (1960), 490-499.
22. G. R. Grimmett and D. R. Stirzaker, Probability of Random Processes, 2nd edition, Oxford University Press, Oxford, 2001.
23. T. E. Harris, The Theory of Branching Processes, Springer, Berlin, 1963.
24. S. Janson, Conditioned Gallon-Watson trees do not grow, DMTCS Proc, Fourth Colloquium Math Comput Sci Algorithms, Trees Combin Probab, 2006, pp. 331-334.
25. D. P. Kennedy, The Gallon-Watson process conditioned on the lolal progeny, J Appl Probab 12 (1975), 800-806.
26. D. E. Knuth, The Art of Computer Programming: Sorting and Searching, volume 3, Addison-Wesley, Reading, MA, 1973.
27. V. F. Kolchin, Branching processes and random trees. In, Problems in Cybernetics, Combinatorial Analysis and Graph Theory (in Russian), Moscow, Nauka, 1980, pp. 85-97.
28. V. F. Kolchin, Random Mappings, Optimization Software, New York, 1986.
29. A. G. Konheim and D. J. Newman, A note on growing binary trees, Discrete Math 4 (1973), 57-63.
30. M. Łuczak and P. Winkler, Building uniformly random sublrees, Random Struct Algorithms 24 (2004), 420-443.
31. H. Mahmoud, Distances in plane-oriented recursive trees, J Computat Appl Math 41 (1992), 237-245.
32. H. Mahmoud, R. T. Smythe, and J. Szymanski, On the structure of random plane-oriented recursive trees and their branches, Random Struct Algorithms 4 (1993), 151-176.
33. C. Martínez and S. Roura, Optimal sampling strategies in quicksort and quickselect, SIAM J Comput 31 (2001), 683-705.
34. A. Meir and J. W. Moon, On the altitude of nodes in random trees, Can J Math 30 (1978), 997-1015.
35. J. W. Moon, Counting Labelled Trees, Number 1 in Canadian Mathematical Monographs. Canadian Mathematical Congress, Montreal, 1970.
36. D. R. Morrison, patricia, Practical algorithm to retrieve information coded in alphanumeric, J ACM 15 (1968), 514-534.
37. A. Panholzer and H. Prodinger, Analysis of some statistics for increasing tree families, Discrete Math Theor Comput Sci 6 (2004), 437-460.
38. A. Panholzer and H. Prodinger, The level of nodes in increasing trees revisited, Random Struct Algorithms 31 (2007), 203-226.
39. B. Pittel, On growing random binary trees, J Math Anal Appl 103 (1984), 461-480.
40. B. Pittel, Asymptotic growth of a class of random trees, Ann Probab 13 (1985), 414-427.
41. B. Pittel, Note on the height of random recursive trees and m-ary search trees, Random Struct Algorithms 5 (1994), 337-347.
42. H. Prodinger and F. J. Urbanek, On monotone functions of tree structures, Discrete Appl Math 5 (1983), 222-239.
43. B. Reed, How tall is a tree? In, STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, ACM Press, 2000, New York, NY, pp. 479-483.
44. B. Reed, The height of a random binary search tree, J ACM 50 (2003), 306-332.
45. R. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
46. R. T. Smythe and H. M. Mahmoud, A survey of recursive trees, Theor Probab Math Stat 51 (1995), 1-27.
47. W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Wiley, New York, 2001.
48. J. Szymański, On a non-uniform random recursive tree, In M. Karoński and Z. Palka, editors, Random Graphs '85, volume 33 of Annals of Discrete Mathematics, North Holland, 1987, Amsterdam, pp. 297-306.