Mixing time of exponential random graphs

Annals of Applied Probability

Volumn 21, Issue 6, 2011, Pages 2146-2170

  Bhamidi, Shankar ^a   Bresler, Guy ^b   Sly, Allan ^c  

^a University of North Carolina at Chapel Hill   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Exponential random graphs; Mixing times; Path coupling

Indexed keywords

EID: 82655173713     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/10-AAP740     Document Type: Article

References (19)

1. ALBERT, R. and BARABÁSI, A.-L. (2002). Statistical mechanics of complex networks. Rev. Modern Phys. 74 47-97. MR1895096
2. ALDOUS, D. and FILL, J. (2011). Reversible Markov chains and random walks on graphs. Unpublished manuscript.
3. ANDERSON, C. J.,WASSERMAN, S. and CROUCH, B. (1999). A p* primer: Logit models for social networks. Social Networks 21 37-66.
4. BUBLEY, R. and DYER, M. (1997). Path coupling: A technique for proving rapid mixing in Markov chains. In Foundations of Computer Science (FOCS) 223-231. IEEE.
5. CHATTERJEE, S. and VARADHAN, S. R. S. (2011). The large deviation principle for the Erdos-Renyi random graph. European J. Comb. To appear. Available at arXiv:1008. 1946v2.
6. CHUNG, F. R. K., GRAHAM, R. L. andWILSON, R. M. (1989). Quasi-random graphs. Combinatorica 9 345-362. MR1054011
7. DURRETT, R. (2007). Random Graph Dynamics. Cambridge Univ. Press, Cambridge. MR2271734
8. DYER, M. and FRIEZE, A. (2003). Randomly coloring graphs with lower bounds on girth and maximum degree. Random Structures Algorithms 23 167-179. MR1995689
9. DYER, M., FRIEZE, A. and JERRUM, M. (2002). On counting independent sets in sparse graphs. SIAM J. Comput. 31 1527-1541 (electronic). MR1936657 (Pubitemid 35298410)
10. FRANK, O. and STRAUSS, D. (1986). Markov graphs. J. Amer. Statist. Assoc. 81 832-842. MR0860518
11. JAYNES, E. T. (1957). Information theory and statistical mechanics. Phys. Rev. (2) 106 620-630. MR0087305
12. JAYNES, E. T. (1957). Information theory and statistical mechanics. II. Phys. Rev. (2) 108 171-190. MR0096414
13. KASS, R. E. andWASSERMAN, L. (1996). The selection of prior distributions by formal rules. J. Amer. Statist. Assoc. 91 1343-1370.
14. KRIVELEVICH, M. and SUDAKOV, B. (2005). Pseudo-random graphs. In Conference on Finite and Infinite Sets 1-64. Bolyai Mathematical Society, Budapest.
15. NEWMAN, M. E. J. (2003). The structure and function of complex networks. SIAM Rev. 45 167-256 (electronic). MR2010377
16. PARK, J. andNEWMAN, M. E. J. (2004). Solution of the 2-star model of a network. Phys. Rev. E (3) 70 066146.1-066146.5.
17. PARK, J. and NEWMAN, M. E. J. (2005). Solution for the properties of a clustered network. Phys. Rev. E (3) 72 026136.1-026136.5.
18. SNIJDERS, T. A., PATTISON, P., ROBBINS, G. and HANDCOCK, M. (2006). New specifications for exponential random graph models. Sociological Methodology 36 99-153. (Pubitemid 44797747)
19. WASSERMAN, S. and PATTISON, P. (1996). Logit models and logistic regressions for social networks. I. An introduction to Markov graphs and p. Psychometrika 61 401-425. MR1424909 (Pubitemid 126345724)