The Annals of Applied Probability

Mixing time of exponential random graphs

Shankar Bhamidi, Guy Bresler, and Allan Sly

Full-text: Open access

Abstract

A variety of random graph models has been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommunication, biochemical and other networks. A key model, extensively used in sociology literature, is the exponential random graph model. This model seeks to incorporate in random graphs the notion of reciprocity, that is, the larger than expected number of triangles and other small subgraphs. Sampling from these distributions is crucial for parameter estimation hypothesis testing and more generally for understanding basic features of the network model itself. In practice, sampling is typically carried out using Markov chain Monte Carlo, in particular, either the Glauber dynamics or the Metropolis–Hastings procedure.

In this paper we characterize the high and low temperature regimes of the exponential random graph model. We establish that in the high temperature regime the mixing time of the Glauber dynamics is Θ(n2 log n), where n is the number of vertices in the graph; in contrast, we show that in the low temperature regime the mixing is exponentially slow for any local Markov chain. Our results, moreover, give a rigorous basis for criticisms made of such models. In the high temperature regime, where sampling with Markov chain Monte Carlo is possible, we show that any finite collection of edges is asymptotically independent; thus, the model does not possess the desired reciprocity property and is not appreciably different from the Erdős–Rényi random graph.

Article information

Source
Ann. Appl. Probab. Volume 21, Number 6 (2011), 2146-2170.

Dates
First available in Project Euclid: 23 November 2011

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1322057318

Digital Object Identifier
doi:10.1214/10-AAP740

Mathematical Reviews number (MathSciNet)
MR2895412

Zentralblatt MATH identifier
1238.60011

Subjects
Primary: 60C05: Combinatorial probability 05C80: Random graphs [See also 60B20] 90B15: Network models, stochastic

Keywords
Mixing times exponential random graphs path coupling

Citation

Bhamidi, Shankar; Bresler, Guy; Sly, Allan. Mixing time of exponential random graphs. Ann. Appl. Probab. 21 (2011), no. 6, 2146--2170. doi:10.1214/10-AAP740. https://projecteuclid.org/euclid.aoap/1322057318.


Export citation

References

  • [1] Albert, R. and Barabási, A.-L. (2002). Statistical mechanics of complex networks. Rev. Modern Phys. 74 47–97.
  • [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. and Wilson, R. M. (1989). Quasi-random graphs. Combinatorica 9 345–362.
  • [7] Durrett, R. (2007). Random Graph Dynamics. Cambridge Univ. Press, Cambridge.
  • [8] Dyer, M. and Frieze, A. (2003). Randomly coloring graphs with lower bounds on girth and maximum degree. Random Structures Algorithms 23 167–179.
  • [9] Dyer, M., Frieze, A. and Jerrum, M. (2002). On counting independent sets in sparse graphs. SIAM J. Comput. 31 1527–1541 (electronic).
  • [10] Frank, O. and Strauss, D. (1986). Markov graphs. J. Amer. Statist. Assoc. 81 832–842.
  • [11] Jaynes, E. T. (1957). Information theory and statistical mechanics. Phys. Rev. (2) 106 620–630.
  • [12] Jaynes, E. T. (1957). Information theory and statistical mechanics. II. Phys. Rev. (2) 108 171–190.
  • [13] Kass, R. E. and Wasserman, 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).
  • [16] Park, J. and Newman, 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.
  • [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.