Estimating and understanding exponential random graph models

Annals of Statistics

Volumn 41, Issue 5, 2013, Pages 2428-2461

  Chatterjee, Sourav ^a   Diaconis, Persi ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Erdos R nyi; Exponential random graph models; Graph limit; Parameter estimation; Random graph

Indexed keywords

EID: 84888884588     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/13-AOS1155     Document Type: Article

References (58)

1. ALDOUS, D. J. (1981). Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11 581-598. MR0637937
2. ARISTOFF, D. and RADIN, C. (2011). Emergent structures in large networks. Preprint. Available at http://arxiv.org/abs/1110.1912.
3. AUSTIN, T. (2008). On exchangeable random variables and the statistics of large graphs and hypergraphs. Probab. Surv. 5 80-145. MR2426176
4. AUSTIN, T. and TAO, T. (2010). Testability and repair of hereditary hypergraph properties. Random Structures Algorithms 36 373-463. MR2666763
5. BESAG, J. (1975). Statistical analysis of non-lattice data. Statistician 24 179-195.
6. BHAMIDI, S., BRESLER, G. and SLY, A. (2008). Mixing time of exponential random graphs. In 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 803-812. IEEE, Washington, DC.
7. BOLLOBÁS, B. (2001). Random Graphs, 2nd ed. Cambridge Studies in Advanced Mathematics 73. Cambridge Univ. Press, Cambridge. MR1864966
8. BOLLOBÁS, B. and RIORDAN, O. (2009). Metrics for sparse graphs. In Surveys in Combinatorics 2009. London Mathematical Society Lecture Note Series 365 211-287. Cambridge Univ. Press, Cambridge. MR2588543
9. BORGS, C., CHAYES, J., LOVÁSZ, L., SÓS, V. T. and VESZTERGOMBI, K. (2006). Counting graph homomorphisms. In Topics in Discrete Mathematics. Algorithms and Combinatorics 26 315-371. Springer, Berlin. MR2249277
10. BORGS, C., CHAYES, J. T., LOVÁSZ, L., SÓS, V. T. and VESZTERGOMBI, K. (2008). Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Adv. Math. 219 1801-1851. MR2455626
11. BORGS, C., CHAYES, J. T., LOVÁSZ, L., SÓS, V. T. and VESZTERGOMBI, K. (2012). Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math. (2) 176 151-219. MR2925382
12. CHATTERJEE, S. (2007). Estimation in spin glasses: A first step. Ann. Statist. 35 1931-1946. MR2363958
13. CHATTERJEE, S. and DEY, P. S. (2010). Applications of Stein's method for concentration inequalities. Ann. Probab. 38 2443-2485. MR2683635
14. CHATTERJEE, S., DIACONIS, P. and SLY, A. (2011). Random graphs with a given degree sequence. Ann. Appl. Probab. 21 1400-1435. MR2857452
15. CHATTERJEE, S. and VARADHAN, S. R. S. (2011). The large deviation principle for the Erdos-Rényi random graph. European J. Combin. 32 1000-1017. MR2825532
16. COMETS, F. and JANŽURA, M. (1998). A central limit theorem for conditionally centred random fields with an application to Markov fields. J. Appl. Probab. 35 608-621. MR1659520
17. CORANDER, J.,DAHMSTRÖM, K. andDAHMSTRÖM, P. (2002).Maximum likelihood estimation for exponential random graph models. In Contributions to Social Network Analysis, Information Theory and Other Topics in Statistics: A Festschrift in Honour of Ove Frank (J. Hagberg, ed.) 1-17. Dept. Statistics, Univ. Stockholm.
18. DIACONIS, P. and JANSON, S. (2008). Graph limits and exchangeable random graphs. Rend. Mat. Appl. (7) 28 33-61. MR2463439
19. ERDO S, P. and RÉNYI, A. (1960). On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 17-61. MR0125031
20. ERDÖS, P. and STONE, A. H. (1946). On the structure of linear graphs. Bull. Amer. Math. Soc. (N.S.) 52 1087-1091. MR0018807
21. FIENBERG, S. E. (2010). Introduction to papers on the modeling and analysis of network data. Ann. Appl. Stat. 4 1-4. MR2758081
22. FIENBERG, S. E. (2010). Introduction to papers on the modeling and analysis of network data - II. Ann. Appl. Stat. 4 533-534. MR2744531
23. FORTUIN, C. M., KASTELEYN, P. W. and GINIBRE, J. (1971). Correlation inequalities on some partially ordered sets. Comm. Math. Phys. 22 89-103. MR0309498
24. FRANK, O. and STRAUSS, D. (1986). Markov graphs. J. Amer. Statist. Assoc. 81 832-842. MR0860518
25. FREEDMAN, M., LOVÁSZ, L. and SCHRIJVER, A. (2007). Reflection positivity, rank connectivity, and homomorphism of graphs. J. Amer. Math. Soc. 20 37-51 (electronic). MR2257396
26. FRIEZE, A. andKANNAN, R. (1999). Quick approximation to matrices and applications. Combinatorica 19 175-220. MR1723039
27. GELFAND, I. M. and FOMIN, S. V. (2000). Calculus of Variations. Dover, New York.
28. GELMAN, A. and MENG, X.-L. (1998). Simulating normalizing constants: From importance sampling to bridge sampling to path sampling. Statist. Sci. 13 163-185. MR1647507
29. GEYER, C. J. and THOMPSON, E. A. (1992). Constrained Monte Carlo maximum likelihood for dependent data. J. R. Stat. Soc. Ser. B Stat. Methodol. 54 657-699. MR1185217
30. HÄGGSTRÖM, O. and JONASSON, J. (1999). Phase transition in the random triangle model. J. Appl. Probab. 36 1101-1115. MR1742153
31. HANDCOCK, M. S. (2003). Assessing degeneracy in statistical models of social networks. Working Paper 39, Center for Statistics and the Social Sciences, Univ. Washington, Seattle, WA.
32. HOLLAND, P. W. and LEINHARDT, S. (1981). An exponential family of probability distributions for directed graphs. J. Amer. Statist. Assoc. 76 33-65. MR0608176
33. HOOVER, D. N. (1982). Row-column exchangeability and a generalized model for probability. In Exchangeability in Probability and Statistics (Rome, 1981) 281-291. North-Holland, Amsterdam. MR0675982
34. JANSON, S., ŁUCZAK, T. and RUCINSKI, A. (2000). Random Graphs. Wiley, New York. MR1782847
35. KALLENBERG, O. (2005). Probabilistic Symmetries and Invariance Principles. Springer, New York. MR2161313
36. KOU, S. C., ZHOU, Q. andWONG, W. H. (2006). Equi-energy sampler with applications in statistical inference and statistical mechanics. Ann. Statist. 34 1581-1652. MR2283711
37. LOVÁSZ, L. (2006). The rank of connection matrices and the dimension of graph algebras. European J. Combin. 27 962-970. MR2226430
38. LOVÁSZ, L. (2007). Connection matrices. In Combinatorics, Complexity, and Chance. Oxford Lecture Series in Mathematics and its Applications 34 179-190. Oxford Univ. Press, Oxford. MR2314569
39. LOVÁSZ, L. and SÓS, V. T. (2008). Generalized quasirandom graphs. J. Combin. Theory Ser. B 98 146-163. MR2368030
40. LOVÁSZ, L. and SZEGEDY, B. (2006). Limits of dense graph sequences. J. Combin. Theory Ser. B 96 933-957. MR2274085
41. LOVÁSZ, L. and SZEGEDY, B. (2007). Szemerédi's lemma for the analyst. Geom. Funct. Anal. 17 252-270. MR2306658
42. LOVÁSZ, L. and SZEGEDY, B. (2009). Contractors and connectors of graph algebras. J. Graph Theory 60 11-30. MR2478356
43. LOVÁSZ, L. and SZEGEDY, B. (2010). Testing properties of graphs and functions. Israel J. Math. 178 113-156. MR2733066
44. LUBETZKY, E. and ZHAO, Y. (2012). On replica symmetry of large deviations in random graphs. Preprint. Available at http://arxiv.org/abs/1210.7013.
45. PARK, J. and NEWMAN, M. E. J. (2004). Solution of the two-star model of a network. Phys. Rev. E (3) 70 066146, 5. MR2133810
46. PARK, J. and NEWMAN, M. E. J. (2005). Solution for the properties of a clustered network. Phys. Rev. E (3) 72 026136, 5.
47. RADIN, C. and SADUN, L. (2013). Phase transitions in a complex network. J. Phys. A 46 305002.
48. RADIN, C. and YIN, M. (2011). Phase transitions in exponential random graphs. Preprint. Available at http://arxiv.org/abs/1108.0649.
49. 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
50. ROBBINS, H. andMONRO, S. (1951). A stochastic approximation method. Ann. Math. Statist. 22 400-407. MR0042668
51. SANOV, I. N. (1961). On the probability of large deviations of random variables. In Select. Transl. Math. Statist. and Probability, Vol. 1 213-244. Amer. Math. Soc., Providence, RI. MR0116378
52. SNIJDERS, T. A. (2002). Markov chain Monte Carlo estimation of exponential random graph models. J. Soc. Structure 3.
53. SNIJDERS, T. A. B., PATTISON, P. E., ROBINS, G. L. and HANDCOCK, M. S. (2006). New specifications for exponential random graph models. Sociol. Method. 36 99-153.
54. STRAUSS, D. (1986). On a general class of models for interaction. SIAM Rev. 28 513-527. MR0867682
55. TALAGRAND, M. (2003). Spin Glasses: A Challenge for Mathematicians. Ergebnisse der Mathematik und Ihrer Grenzgebiete. 3. Folge. A Series of Modern Surveys in Mathematics [Results in Mathematics and Related Areas. 3rd Series. A Series of Modern Surveys in Mathematics] 46. Springer, Berlin. MR1993891
56. TURÁN, P. (1941). Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48 436- 452. MR0018405
57. WASSERMAN, S. and FAUST, K. (2010). Social Network Analysis: Methods and Applications. Structural Analysis in the Social Sciences, 2nd ed. Cambridge Univ. Press, Cambridge.
58. YIN, M. (2012). Critical phenomena in exponential random graphs. Preprint. Available at http://arxiv.org/abs/1208.2992.