Estimating and understanding exponential random graph models
Sourav Chatterjee,Persi Diaconis +1 more
Reads0
Chats0
TLDR
In this paper, the authors introduce a method for the theoretical analysis of exponential random graph models based on a large deviation approximation to the normalizing constant shown to be consistent using theory developed by Chatterjee and Varadhan [European J. Combin. 32 (2011) 1000-1017].Abstract:
We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations approximation to the normalizing constant shown to be consistent using theory developed by Chatterjee and Varadhan [European J. Combin. 32 (2011) 1000–1017]. The theory explains a host of difficulties encountered by applied workers: many distinct models have essentially the same MLE, rendering the problems “practically” ill-posed. We give the first rigorous proofs of “degeneracy” observed in these models. Here, almost all graphs have essentially no edges or are essentially complete. We supplement recent work of Bhamidi, Bresler and Sly [2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2008) 803–812 IEEE] showing that for many models, the extra sufficient statistics are useless: most realizations look like the results of a simple Erdős–Renyi model. We also find classes of models where the limiting graphs differ from Erdős–Renyi graphs. A limitation of our approach, inherited from the limitation of graph limit theory, is that it works only for dense graphs.read more
Citations
More filters
Journal ArticleDOI
Matrix estimation by Universal Singular Value Thresholding
TL;DR: This paper introduces a simple estimation procedure, called Universal Singular Value Thresholding (USVT), that works for any matrix that has "a little bit of structure" and achieves the minimax error rate up to a constant factor.
Journal ArticleDOI
Matrix estimation by Universal Singular Value Thresholding
TL;DR: The Universal Singular Value Thresholding (USVT) estimator as discussed by the authors achieves the minimax error rate up to a constant factor for any matrix that has a little bit of structure.
Journal ArticleDOI
The statistical physics of real-world networks
Giulio Cimini,Giulio Cimini,Tiziano Squartini,Fabio Saracco,Diego Garlaschelli,Diego Garlaschelli,Andrea Gabrielli,Andrea Gabrielli,Guido Caldarelli +8 more
TL;DR: This Review describes advances in the statistical physics of complex networks and provides a reference for the state of the art in theoretical network modelling and applications to real-world systems for pattern detection and network reconstruction.
Journal ArticleDOI
Consistency under sampling of exponential random graph models
TL;DR: It is shown that this apparently trivial condition is in fact violated by many popular and scientifically appealing models, and that satisfying it drastically limits ERGM's expressive power.
Proceedings ArticleDOI
Subgraph frequencies: mapping the empirical and extremal geography of large graph collections
TL;DR: This work finds that the space of subgraph frequencies is governed both by its combinatorial properties --- based on extremal results that constrain all graphs --- as well as by its empirical properties, manifested in the way that real social graphs appear to lie near a simple one-dimensional curve through this space.
References
More filters
Journal ArticleDOI
Szemerédi’s Lemma for the Analyst
László Lovász,Balázs Szegedy +1 more
TL;DR: In this article, it was shown that Szemeredi's regularity lemma can be interpreted as a result in analysis, which has many applications in graph theory, graph property testing, combinatorial number theory, etc.
Graph limits and exchangeable random graphs
Persi Diaconis,Svante Janson +1 more
TL;DR: A clear connection between deFinetti's theorem for exchangeable arrays and the emerging area of graph limits is developed and the graph theory is translated into more classical prob- ability.
Journal ArticleDOI
On a general class of models for interaction
TL;DR: In this article, a class of probability models for configurations of interacting points in a domain is developed, where the distributions depend on a function which may be viewed as giving the potential energy of the configurations.
Journal ArticleDOI
Random graphs with a given degree sequence
TL;DR: In this paper, it was shown that the degree sequence of a graph has graph limits in the sense of Lovasz and Szegedy with identifiable limits, and a fast, provably convergent algorithm for the maximum likelihood estimate (MLE) was derived.
Related Papers (5)
An Exponential Family of Probability Distributions for Directed Graphs
Paul W. Holland,Samuel Leinhardt +1 more