A central limit theorem in the β-model for undirected random graphs with a diverging number of vertices

Biometrika

Volumn 100, Issue 2, 2013, Pages 519-524

  Yan, Ting ^a   Xu, Jinfeng ^b  

^a CENTRAL CHINA NORMAL UNIVERSITY   (China)

^b NEW YORK UNIVERSITY SCHOOL OF MEDICINE   (United States)

Author keywords

model; Central limit theorem; Fisher information matrix

Indexed keywords

EID: 84878070383     PISSN: 00063444     EISSN: 14643510     Source Type: Journal    
DOI: 10.1093/biomet/ass084     Document Type: Article

References (8)

1. BLITZSTEIN, J. & DIACONIS, P. (2011). A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6, 489-522.
2. BRADLEY, R. A. & TERRY, M. E. (1952). Rank analysis of incomplete block designs I. The method of paired comparisons. Biometrika 39, 324-45.
3. CHATTERJEE, S., DIACONIS, P. & SLY, A. (2011). Random graphs with a given degree sequence. Ann. Appl. Prob. 21, 1400-35.
4. HOLLAND, P. W. & LEINHARDT, S. (1981). An exponential family of probability distributions for random graphs (with Discussion). J. Am. Statist. Assoc. 76, 33-50.
5. JACKSON, M. O. (2008). Social and Economic Networks. Princeton: Princeton University Press.
6. LOEVE, M. (1977). Probability Theory, 4th ed. New York: Springer.
7. NEWMAN, M. E. J., STROGATZ, S. H. & WATTS D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64, 026118.
8. SIMONS, G. & YAO, Y. (1999). Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons. Ann. Statist. 27, 1041-60.