Maximum lilkelihood estimation in the β-model

Annals of Statistics

Volumn 41, Issue 3, 2013, Pages 1085-1110

  Rinaldo, Alessandro ^a   Petrović, Sonja ^b   Fienberg, Stephen E ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c NONE   (United States)

Author keywords

model; Maximum likelihood estimator; Polytope of degree sequences; Random graphs

Indexed keywords

EID: 84879380670     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/12-AOS1078     Document Type: Article

References (50)

1. ALBERT, R. andBARABÁSI, A.-L. (2002). Statistical mechanics of complex networks. Rev. Modern Phys. 74 47-97. MR1895096
2. BARNDORFF-NIELSEN, O. (1978). Information and Exponential Families in Statistical Theory. Wiley, Chichester. MR0489333
3. BARVINOK, A. and HARTIGAN, J. A. (2010). The number of graphs and a random graph with a given degree sequence. Available at http://arxiv.org/pdf/ 1003.0356v2.
4. BLITZSTEIN, J. and DIACONIS, P. (2010). A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6 489-522. MR2809836
5. BROWN, L. (1986). Fundamentals of Statistical Exponential Families. Institute of Mathematical Statistics Lecture Notes - Monograph Series 9. IMS, Hayward, CA.
6. CHATTERJEE, S., DIACONIS, P. and SLY, A. (2011). Random graphs with a given degree sequence. Ann. Appl. Probab. 21 1400-1435. MR2857452
7. COHEN, R. and HAVLIN, S. (2010). Complex Networks: Structure, Robustness and Function. Cambridge Univ. Press, Cambridge.
8. COVER, T. M. and THOMAS, J. A. (1991). Elements of Information Theory. Wiley, New York. MR1122806
9. DIACONIS, P. and JANSON, S. (2008). Graph limits and exchangeable random graphs. Rend. Mat. Appl. (7) 28 33-61. MR2463439
10. ERDO S, P. and RÉNYI, A. (1959). On random graphs. I. Publ. Math. Debrecen 6 290-297. MR0120167
11. FIENBERG, S. E. and RINALDO, A. (2012). Maximum likelihood estimation in log-linear models. Ann. Statist. 40 996-1023. MR2985941
12. FIENBERG, S. E.,MEYER, M. M. andWASSERMAN, S. S. (1985). Statistical analysis of multiple sociometric relations. J. Amer. Statist. Assoc. 80 51-67.
13. FIENBERG, S. E. andWASSERMAN, S. S. (1981a). Categorical data analysis of single sociometric relations. Sociological Methodology 1981 156-192.
14. FIENBERG, S. E. andWASSERMAN, S. S. (1981b). An exponential family of probability distributions for directed graphs: Comment. J. Amer. Statist. Assoc. 76 54-57.
15. FOSTER, J. G., FOSTER, D. V., GRASSBERGER, P. and PACZUSKI, M. (2007). Link and subgraph likelihoods in random undirected networks with fixed and partially fixed degree sequences. Phys. Rev. E (3) 76 046112, 12. MR2365608
16. FUKUDA, K. (2004). From the zonotope construction to the Minkowski addition of convex polytopes. J. Symbolic Comput. 38 1261-1272. MR2094220
17. GAWRILOW, E. and JOSWIG, M. (2000). polymake: A framework for analyzing convex polytopes. In Polytopes - Combinatorics and Computation (Oberwolfach, 1997) (G. Kalai and G.M. Ziegler, eds.). DMV Seminar 29 43-73. Birkhäuser, Basel. MR1785292
18. GEIGER, D.,MEEK, C. and STURMFELS, B. (2006). On the toric algebra of graphical models. Ann. Statist. 34 1463-1492. MR2278364
19. GEYER, C. J. (2009). Likelihood inference in exponential families and directions of recession. Electron. J. Stat. 3 259-289. MR2495839
20. GOLDENBERG, A., ZHENG, A. X., FIENBERG, S. E. and AIROLDI, E. M. (2010). A survey of statistical network models. Foundations and Trends in Machine Learning 2 129-233.
21. GOODREAU, S. M. (2007). Advances in exponential random graph (p) models applied to a large social network. Social Networks 29 231-248.
22. HABERMAN, S. (1981). Discussion of "An exponential family of probability distributions for directed graphs," by P. W. Holland and S. Leinhardt. J. Amer. Statist. Assoc. 76 60-61.
23. HANDCOCK, M. S. andMORRIS, M. (2007). A simple model for complex networks with arbitrary degree distribution and clustering. In Statistical Network Analysis: Models, Issues and New Directions (E. Airoldi, D. Blei, S. E. Fienberg, A. Goldenberg, E. Xing and A. Zheng, eds.). Lecture Notes in Computer Science 4503 103-114. Springer, Berlin.
24. HARA, H. and TAKEMURA, A. (2010). Connecting tables with zero-one entries by a subset of a Markov basis. In Algebraic Methods in Statistics and Probability II (M. Viana and H. Wynn, eds.). Contemporary Mathematics 516 199-213. Amer. Math. Soc., Providence, RI. MR2730750
25. HOLLAND, P.W. and LEINHARDT, S. (1981). An exponential family of probability distributions for directed graphs. J. Amer. Statist. Assoc. 76 33-50.
26. KOLACZYK, E. D. (2009). Statistical Analysis of Network Data: Methods and Models. Springer, New York. MR2724362
27. LAURITZEN, S. L. (2003). Rasch models with exchangeable rows and columns. In Bayesian Statistics, 7 (Tenerife, 2002) (J. M. Bernardo, M. J. Bayarri, J. O. Berger, A. P. Dawid, D. Heckerman, A. F. M. Smith and M. West, eds.) 215-232. Oxford Univ. Press, New York. MR2003175
28. LAURITZEN, S. L. (2008). Exchangeable Rasch matrices. Rend. Mat. Appl. (7) 28 83-95. MR2463441
29. LOVÁSZ, L. and SZEGEDY, B. (2006). Limits of dense graph sequences. J. Combin. Theory Ser. B 96 933-957. MR2274085
30. MAHADEV, N. V. R. and PELED, U. N. (1995). Threshold Graphs and Related Topics. Annals of Discrete Mathematics 56. North-Holland, Amsterdam. MR1417258
31. MEYER, M. M. (1982). Transforming contingency tables. Ann. Statist. 10 1172-1181. MR0673652
32. MORTON, J. (2013). Relations among conditional probabilities. J. Symbolic Comput. 50 478-492. MR2996892
33. NEWMAN, M. E. J. (2003). The structure and function of complex networks. SIAM Rev. 45 167-256 (electronic). MR2010377
34. NEWMAN, M. E. J. (2010). Networks: An Introduction. Oxford Univ. Press, Oxford. MR2676073
35. NEWMAN, M., BARABÁSI, A.-L. andWATTS, D. J., eds. (2006). The Structure and Dynamics of Networks. Princeton Univ. Press, Princeton, NJ. MR2352222
36. NEWMAN, M. E. J., STROGATZ, S. H. and WATTS, D. J. (2001). Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E (3) 64 026118, 17.
37. OGAWA, M., HARA, H. and TAKEMURA, A. (2013). Graver basis for an undirected graph and its application to testing the beta model of random graphs. Ann. Inst. Statist. Math. 65 191-212.
38. PARK, J. and NEWMAN, M. E. J. (2004). Statistical mechanics of networks. Phys. Rev. E (3) 70 066117, 13. MR2133807
39. PERRY, P. O. andWOLFE, P. J. (2012). Null models for network data. Available at http://arxiv.org/abs/1201.5871.
40. PETROVI'C, S., RINALDO, A. and FIENBERG, S. E. (2010). Algebraic statistics for a directed random graph model with reciprocation. In Algebraic Methods in Statistics and Probability II. Contemporary Mathematics 516 261-283. Amer. Math. Soc., Providence, RI. MR2730754
41. RINALDO, A., FIENBERG, S. E. and ZHOU, Y. (2009). On the geometry of discrete exponential families with application to exponential random graph models. Electron. J. Stat. 3 446-484. MR2507456
42. RINALDO, A., PETROVÍC, S. and FIENBERG, S. E. (2013). Supplement to "Maximum lilkelihood estimation in the β-model." DOI:10.1214/12-AOS1078SUPP.
43. ROBINS, D., PATTISON, P., KALISH, Y. and LUSHER, D. (2007). An introduction to exponential random graph (p) models for social networks. Social Networks 29 173-191.
44. SCHRIJVER, A. (1998). Theory of Linear and Integer Programming. Wiley, New York.
45. STANLEY, R. P. (1991). A zonotope associated with graphical degree sequences. In Applied Geometry and Discrete Mathematics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 4 555-570. Amer. Math. Soc., Providence, RI. MR1116376
46. VIGER, F. and LATAPY, M. (2005). Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In Computing and Combinatorics. Lecture Notes in Computer Science 3595 440-449. Springer, Berlin. MR2190867
47. WEIBEL, C. (2010). Implementation and parallelization of a reverse-search algorithm for Minkowski sums. In Proceedings of the 12thWorkshop on Algorithm Engineering and Experiments (ALENEX 2010) 34-42. SIAM, Philadelphia. Available at https://sites.google.com/site/christopheweibel/research/minksum.
48. WILLINGER, W.,ALDERSON, D. andDOYLE, J. C. (2009).Mathematics and the Internet: A source of enormous confusion and great potential. Notices Amer. Math. Soc. 56 586-599. MR2509062
49. YAN, T. and XU, J. (2012). A central limit theorem in the β-model for undirected random graphs with a diverging number of vertices. Available at http://arxiv.org/abs/1202.3307.
50. YAN, T.,XU, J. andYANG, Y. (2012). High dimensionalWilks phenomena in random graph models. Available at http://arxiv.org/abs/1201.0058.