The Annals of Applied Probability

Asymptotic quantization of exponential random graphs

Mei Yin, Alessandro Rinaldo, and Sukhada Fadnavis

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We describe the asymptotic properties of the edge-triangle exponential random graph model as the natural parameters diverge along straight lines. We show that as we continuously vary the slopes of these lines, a typical graph drawn from this model exhibits quantized behavior, jumping from one complete multipartite graph to another, and the jumps happen precisely at the normal lines of a polyhedral set with infinitely many facets. As a result, we provide a complete description of all asymptotic extremal behaviors of the model.

Article information

Source
Ann. Appl. Probab., Volume 26, Number 6 (2016), 3251-3285.

Dates
Received: January 2015
Revised: July 2015
First available in Project Euclid: 15 December 2016

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

Digital Object Identifier
doi:10.1214/16-AAP1175

Mathematical Reviews number (MathSciNet)
MR3582803

Zentralblatt MATH identifier
1356.05138

Subjects
Primary: 05C80: Random graphs [See also 60B20]
Secondary: 62F99: None of the above, but in this section 82B26: Phase transitions (general)

Keywords
Exponential random graphs graph limits normal cone asymptotic quantization

Citation

Yin, Mei; Rinaldo, Alessandro; Fadnavis, Sukhada. Asymptotic quantization of exponential random graphs. Ann. Appl. Probab. 26 (2016), no. 6, 3251--3285. doi:10.1214/16-AAP1175. https://projecteuclid.org/euclid.aoap/1481792585


Export citation

References

  • [1] Aldous, D. J. (1981). Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11 581–598.
  • [2] Barndorff-Nielsen, O. (1978). Information and Exponential Families in Statistical Theory. Wiley, Chichester.
  • [3] Bhamidi, S., Bresler, G. and Sly, A. (2011). Mixing time of exponential random graphs. Ann. Appl. Probab. 21 2146–2170.
  • [4] Bollobás, B. (1976). Relations between sets of complete subgraphs. In Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975) 79–84. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg.
  • [5] Bollobás, B. (2001). Random Graphs, 2nd ed. Cambridge Studies in Advanced Mathematics 73. Cambridge Univ. Press, Cambridge.
  • [6] Borgs, C., Chayes, J., Lovász, L., Sós, V. T. and Vesztergombi, K. (2006). Counting graph homomorphisms. In Topics in Discrete Mathematics. Algorithms Combin. 26 315–371. Springer, Berlin.
  • [7] 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.
  • [8] 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.
  • [9] Brown, L. D. (1986). Fundamentals of Statistical Exponential Families with Applications in Statistical Decision Theory. Institute of Mathematical Statistics Lecture Notes—Monograph Series, 9. IMS, Hayward, CA.
  • [10] Chatterjee, S. and Diaconis, P. (2013). Estimating and understanding exponential random graph models. Ann. Statist. 41 2428–2461.
  • [11] Chatterjee, S. and Varadhan, S. R. S. (2011). The large deviation principle for the Erdős–Rényi random graph. European J. Combin. 32 1000–1017.
  • [12] Csiszár, I. and Matúš, F. (2005). Closures of exponential families. Ann. Probab. 33 582–600.
  • [13] Csiszár, I. and Matúš, F. (2008). Generalized maximum likelihood estimates for exponential families. Probab. Theory Related Fields 141 213–246.
  • [14] Diaconis, P. and Janson, S. (2008). Graph limits and exchangeable random graphs. Rend. Mat. Appl. (7) 28 33–61.
  • [15] Diestel, R. (1997). Graph Theory. Graduate Texts in Mathematics 173. Springer, New York.
  • [16] Engström, A. and Norén, P. (2011). Polytopes from subgraph statistics. In 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011). Discrete Math. Theor. Comput. Sci. Proc., AO 305–316. Assoc. Discrete Math. Theor. Comput. Sci., Nancy.
  • [17] Erdős, P., Kleitman, D. J. and Rothschild, B. L. (1976). Asymptotic enumeration of $K_{n}$-free graphs. In Colloquio Internazionale Sulle Teorie Combinatorie (Rome, 1973), Tomo II 19–27. Atti dei Convegni Lincei, No. 17. Accad. Naz. Lincei, Rome.
  • [18] Fadnavis, S. (2012). Graph colorings and graph limits. Available at http://purl.stanford.edu/dr620kx9292.
  • [19] Fienberg, S. E. (2010). Introduction to papers on the modeling and analysis of network data. Ann. Appl. Stat. 4 1–4.
  • [20] Fienberg, S. E. (2010). Introduction to papers on the modeling and analysis of network data—II. Ann. Appl. Stat. 4 533–534.
  • [21] Fisher, D. C. (1989). Lower bounds on the number of triangles in a graph. J. Graph Theory 13 505–512.
  • [22] Frank, O. and Strauss, D. (1986). Markov graphs. J. Amer. Statist. Assoc. 81 832–842.
  • [23] Geyer, C. J. (2009). Likelihood inference in exponential families and directions of recession. Electron. J. Stat. 3 259–289.
  • [24] Geyer, C. J. and Thompson, E. A. (1992). Constrained Monte Carlo maximum likelihood for dependent data. J. Roy. Statist. Soc. Ser. B 54 657–699.
  • [25] Goldenberg, A., Zheng, A. X., Fienberg, S. E. and Airoldi, E. M. (2009). A survey of statistical network models. Found. Trends Mach. Learn. 2 129–233.
  • [26] Goodman, A. W. (1959). On sets of acquaintances and strangers at any party. Amer. Math. Monthly 66 778–783.
  • [27] Häggström, O. and Jonasson, J. (1999). Phase transition in the random triangle model. J. Appl. Probab. 36 1101–1115.
  • [28] Handcock, M. S. (2003). Assessing degeneracy in statistical models of social networks. Working paper no. 39, Center for Statistics and the Social Sciences, Univ. Washington, Seattle, WA.
  • [29] Holland, P. W. and Leinhardt, S. (1981). An exponential family of probability distributions for directed graphs. J. Amer. Statist. Assoc. 76 33–65.
  • [30] Hoover, D. N. (1982). Row–column exchangeability and a generalized model for probability. In Exchangeability in Probability and Statistics (Rome, 1981) (G. Koch andF. Spizzichino, eds.) 281–291. North-Holland, Amsterdam.
  • [31] Hunter, D. R., Handcock, M. S., Butts, C. T., Goodreau, S. M. and Morris, M. (2008). ergm: A package to fit, simulate and diagnose exponential-family models for networks. J. Stat. Softw. 24 1–29.
  • [32] Kallenberg, O. (2005). Probabilistic Symmetries and Invariance Principles. Springer, New York.
  • [33] Kolaczyk, E. D. (2009). Statistical Analysis of Network Data: Methods and Models. Springer, New York.
  • [34] 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.
  • [35] Lovász, L. (2009). Very large graphs. In Current Developments in Mathematics, 2008 67–128. Int. Press, Somerville, MA.
  • [36] Lovász, L. (2012). Large Networks and Graph Limits. American Mathematical Society Colloquium Publications 60. Amer. Math. Soc., Providence, RI.
  • [37] Lovász, L. and Simonovits, M. (1983). On the number of complete subgraphs of a graph. II. In Studies in Pure Mathematics (P. Erdős et al., eds.) 459–495. Birkhäuser, Basel.
  • [38] Lovász, L. and Szegedy, B. (2006). Limits of dense graph sequences. J. Combin. Theory Ser. B 96 933–957.
  • [39] Lubetzky, E. and Zhao, Y. (2015). On replica symmetry of large deviations in random graphs. Random Structures Algorithms 47 109–146.
  • [40] Ma, S.-K. (1985). Statistical Mechanics. World Scientific, Singapore.
  • [41] Newman, M. E. J. (2010). Networks: An Introduction. Oxford Univ. Press, Oxford.
  • [42] Pattison, P. E. and Wasserman, S. (1999). Logit models and logistic regressions for social networks: II. Multivariate relations. Br. J. Math. Stat. Psychol. 52 169–194.
  • [43] Pikhurko, O. (2010). An analytic approach to stability. Discrete Math. 310 2951–2964.
  • [44] Radin, C. and Sadun, L. (2013). Phase transitions in a complex network. J. Phys. A 46 305002, 12.
  • [45] Radin, C. and Yin, M. (2013). Phase transitions in exponential random graphs. Ann. Appl. Probab. 23 2458–2471.
  • [46] Razborov, A. A. (2008). On the minimal density of triangles in graphs. Combin. Probab. Comput. 17 603–618.
  • [47] 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.
  • [48] Robins, G., Pattison, P. and Wasserman, S. (1999). Logit models and logistic regressions for social networks. III. Valued relations. Psychometrika 64 371–394.
  • [49] Robins, G. L., Pattison, P. E., Kalish, Y. and Lusher, D. (2007). An introduction to exponential random graph (p$^{*}$) models for social networks. Soc. Netw. 29 173–191.
  • [50] Shalizi, C. R. and Rinaldo, A. (2013). Consistency under sampling of exponential random graph models. Ann. Statist. 41 508–535.
  • [51] Snijders, T., Pattison, P., Robins, G. and Handcock, M. (2006). New specifications for exponential random graph models. Sociol. Method. 36 99–153.
  • [52] Wasserman, S. and Faust, K. (2010). Social Network Analysis: Methods and Applications. Cambridge Univ. Press, Cambridge.
  • [53] 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.