Normal convergence problem? Two moments and a recurrence may be the clues

Annals of Applied Probability

Volumn 9, Issue 4, 1999, Pages 1260-1302

  Pittel, Boris ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Generating functions; Independence number; Linear extensions; Moments; Normal convergence; Random trees; Recurrencies

Indexed keywords

EID: 0033267675     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1029962872     Document Type: Article

References (25)

1. ALDOUS, D. and PITMAN, J. (1997). The standard additive coalescent, Technical Report 484, Dept. Statistics, Univ. California, Berkeley.
2. ALON, N., BOLLOBÁS, B., BRIGHTWELL, G. and JANSON, S. (1994). Linear extensions of a random partial order. Ann. Appl. Probab. 4 108-123.
3. ARONSON, J., FRIEZE, A. and PITTEL, B. (1998). A maximum matching greedy on sparse random graphs: Karp-Sipser revisited. Random Structures Algorithms 12 111-177.
4. CURTISS, J. H. (1942). A note on the theory of moment generating functions. Ann. Math. Statist. 13 430-433.
5. DEVROYE, L. (1991). Limit laws for local counters in random binary search trees. Random Structures and Algorithms 2 303-315.
6. DYER, M., FRIEZE, A. and PITTEL, B. (1993). The average performance of the greedy matching algorithm. Ann. Appl. Probab. 3 526-552.
7. FILL, J. A. (1996). On the distribution of binary search trees under the random permutation model. Random Structures Algorithms 8 1-25.
8. KARP, R. M. and SIPSER, M. (1981). Maximum matchings in sparse random graphs. In Proceedings of the Twenty-second Annual IEEE Symposium Foundations of Computing 364-375. IEEE, New York.
9. KNUTH, D. E. (1973). The Art of Computer Programming 1. Sorting and Searching. Addison-Wesley, Reading, MA.
10. KNUTH, D. E. and SCHÖNHAGE, A. (1978). The expected linearity of a simple equivalence algorithm. Theoret. Comput. Sci. 6 281-315.
11. KNUTH, D. E. and PITTEL, B. (1989). A recurrence related to trees. Proc. Amer. Math. Soc. 105 335-349.
12. MAHMOUD, H. M. and PITTEL, B. (1989). Analysis of the space of search trees under the random insertion algorithm. J. Algorithms 10 52-75.
13. MEIR, A. and MOON, J. W. (1973). The expected node-independence number of random trees. Proc. Konink. Nederl. Akad. Wetensch. 76 335-341.
14. MEIR, A. and MOON, J. W. (1977). Packing and covering constants for certain families of trees I. J. Graph Theory 1 157-174.
15. MEIR, A. and MOON, J. W. (1977). Packing and covering constants for certain families of trees II. Trans. Amer. Math. Soc. 233 167-178.
16. MEIR, A. and MOON, J. W. (1988). On maximal independent sets of nodes in trees. J. Graph Theory 12 265-283.
17. MEIR, A. and MOON, J. W. (1998). On the log-product of the subtree-sizes of random trees. Random Structures Algorithms 12 197-212.
18. PITTEL, B. (1987). An urn model for cannibal behavior. J. Appl. Probab. 27 522-526.
19. PITTEL, B. (1990). On tree sensus and the giant component in sparse random graphs. Random Structures Algorithms 1 311-332.
20. PITTEL, B. (1997). On a likely shape of the random Ferrers diagram. Adv. in Appl. Math. 18 432-488.
21. RÉNYI, A. (1959). Some remarks on the theory of trees. Publ. Math. Inst. Hungar. Acad. Sci. 4 73-85.
22. STEELE, J. M. (1987). Gibbs' measures on combinatorial objects and the central limit theorem for an exponential family of random trees. Probab. Engrg. Inform. Sci. 1 47-59.
23. SZALAY, M. and TURÁN, P. (1978). On some problems of the statistical theory of partitions with application to characters of the symmetric group III. Acta Math. Acad. Sci. Hung. 32 129-155.
24. YAO, A. C. (1976). On the average behavior of set merging algorithms. In Proceedings of the Eighth Annual ACM Symposium on Theory of Computing 192-195.
25. YAO, A. C. (1985). On the expected performance of path compression algorithms. SIAM J. Comput. 14 129-133.