On the distribution of distances in recursive trees

Journal of Applied Probability

Volumn 33, Issue 3, 1996, Pages 749-757

  Dobrow, Robert P ^a  

^a TRUMAN STATE UNIVERSITY   (United States)

Author keywords

Recursive trees; Stirling numbers of the first kind

Indexed keywords

EID: 0030524515     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S002190020010018X     Document Type: Article

References (9)

1. DEVROYE, L. (1988) Applications of the theory of records in the study of random trees. Acta Info. 26, 123-130.
2. GASTWIRTH, J. L. AND BHATTACHARYA, P. K. (1984) Two probability models of pyramid or chain letter schemes demonstrating that their promotional claims are unreliable. Operat. Res. 32, 527-536.
3. GOLDIE, C. M. (1989) Records, permutations and greatest convex minorants. Math. Proc. Camb. Phil. Soc. 106, 169-177.
4. GRAHAM, R. L., KNUTH, D. E. AND PATASHNIK, O. (1989) Concrete Mathematics. Addison-Wesley, Reading, MA.
5. MAHMOUD, H. M. (1991) Limiting distributions for path lengths in recursive trees. Prob. Eng. Info. Sci. 5, 53-59.
6. MAHMOUD, H. M. AND SMYTHE, R. T. (1992) Asymptotic joint normality of outdegrees of nodes in random recursive trees. Rand. Struct. Alg. 3, 255-266.
7. MOON, J. W. (1974) The distance between nodes in recursive trees. London Math. Soc. Lecture Notes 13, 125-132.
8. NAJOCK, D. AND HEYDE, C. C. (1982) On the number of terminal vertices in certain random trees with an application to stemma construction in philology. J. Appl. Prob. 19, 675-680.
9. SZYMAŃSKI, J. (1990) On the maximum degree and the height of a random recursive tree. In Random Graphs '87. ed. M. Karoński and A. Ruciński. pp. 313-324.