Monotonicity, asymptotic normality and vertex degrees in random graphs

Bernoulli

Volumn 13, Issue 4, 2007, Pages 952-965

  Janson, Svante ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Asymptotic normality; Conditional limit theorem; Cram r Wold theorem; Random allocations; Random graphs; Vertex degrees

Indexed keywords

EID: 47249101018     PISSN: 13507265     EISSN: None     Source Type: Journal    
DOI: 10.3150/07-BEJ6103     Document Type: Article

References (29)

1. Arfwedson, G. (1951). A probability distribution connected with Stirling's second class numbers. Skand. Aktuarietidskr. 34 121-132.
2. Barbour, A.D., Karoński, M. and Ruciński, A. (1989). A central limit theorem for decomposable random variables with applications to random graphs. J. Combin. Theory Ser. B 47 125-145.
3. Békéssy, A. (1963). On classical occupancy problems. I. Magyar Tud. Akad. Mat. Kutató Int. Közl. 8 59-71.
4. Billingsley, P. (1968). Convergence of Probability Measures. New York: Wiley.
5. Bollobás, B. (2001). Random Graphs, 2nd ed. Cambridge: Cambridge Univ. Press.
6. Cramér, H. and Wold, H. (1936). Some theorems on distribution functions. J. London Math. Soc. 11 290-295.
7. Feller, W. (1957). An Introduction to Probability Theory and Its Applications. I, 2nd ed. New York: Wiley.
8. Feller, W. (1971). An Introduction to Probability Theory and its Applications. II, 2nd ed. New York: Wiley.
9. Holst, L. (1979). Two conditional limit theorems with applications. Ann. Statist. 7 551-557.
10. Holst, L. (1979). Asymptotic normality of sum-functions of spacings. Ann. Probab. 7 1066-1072.
11. Holst, L. (1981). Some conditional limit theorems in exponential families. Ann. Probab. 9 818-830.
12. Holst, L. (1981). On sequential occupancy problems. J. Appl. Probab. 18 435-442.
13. Holst, L. (1986). On birthday, collectors', occupancy and other classical um problems. Internat. Statist. Rev. 54 15-27.
14. Hwang, H.-K. and Janson, S. (2007). Local limit theorems for finite and infinite um models. Ann. Probab. To appear.
15. Janson, S. (1990). A functional limit theorem for random graphs with applications to subgraph count statistics. Random Struct. Alg. 1 15-37.
16. Janson, S. (1995). The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph. Random Struct. Alg. 7 337-355.
17. Janson, S. (2001). Moment convergence in conditional limit theorems. J. Appl. Probab. 38 421-437.
18. Janson, S. and Luczak, M. (2006). Asymptotic normality of the k-core in random graphs. Preprint. arXiv:math.CO/0612827
19. Janson, S., Łuczak, T. and Ruciński, A. (2000). Random Graphs. New York: Wiley.
20. Kolchin, V.F., Sevast'yanov, B.A. and Chistyakov, V.P. (1976). Random Allocations. (In Russian.) Moscow: Nauka. English transl.: Washington, D.C.: V.H. Winston & Sons (1978).
21. Le Cam, L. (1958). Un théorème sur la division d'un intervalle par des points pris au hasard. Publ. Inst. Statist. Univ. Paris 7 7-16.
22. von Mises, R. (1939). Über Aufteilungs- und Besetzungs-Wahrscheinlichkeiten. Acta (Trudy] Univ. Asiae Mediae. Ser. V-a. 27 1-21.
23. Nerman, O. (1998). Stochastic monotonicity and conditioning in the limit. Scand. J. Statist. 25 569-572.
24. Pittel, B. (1990). On tree census and the giant component in sparse random graphs. Random Struct. Alg. 1 311-342.
25. Rényi, A. (1962). Three new proofs and a generalization of a theorem of Irving Weiss. Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 203-214.
26. Rosén, B. (1967). On the central limit theorem for sums of dependent random variables. Z. Wahrsch. Verw. Gebiete 7 48-82.
27. Rosén, B. (1969). Asymptotic normality in a coupon collector's problem. Z. Wahrsch. Verw. Gebiete 13 256-279.
28. Steck, G.P. (1957). Limit theorems for conditional distributions. Univ. California Publ. Statist. 2 237-284.
29. Weiss, I. (1958). Limiting distributions in some occupancy problems. Ann. Math. Statist. 29 878-884.