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
Quantifying randomness in real networks.
Chiara Orsini,Marija Mitrović Dankulov,Marija Mitrović Dankulov,Pol Colomer-de-Simón,Almerima Jamakovic,Priya Mahadevan,Amin Vahdat,Kevin E. Bassler,Zoltán Toroczkai,Marián Boguñá,Guido Caldarelli,Santo Fortunato,Dmitri Krioukov,Dmitri Krioukov +13 more
TL;DR: This work considers six real networks and finds that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network.
Journal ArticleDOI
Review of statistical network analysis: models, algorithms, and software
TL;DR: The analysis of network data is an area that is rapidly growing, both within and outside of the discipline of statistics.
Journal ArticleDOI
A tensor approach to learning mixed membership community models
TL;DR: In this article, a tensor spectral decomposition method is proposed to detect communities in the mixed membership Dirichlet model, which allows for nodes to have fractional memberships in multiple communities.
Journal ArticleDOI
Nonlinear large deviations
Sourav Chatterjee,Amir Dembo +1 more
TL;DR: In this paper, a general technique for computing large deviations of nonlinear functions of independent Bernoulli random variables is presented, which is applied to compute the large deviation rate functions for subgraph counts in sparse random graphs.
ReportDOI
Econometrics of network models
TL;DR: This article starts with a discussion of developments in the econometrics of group interactions, and provides a description of statistical and econometric models for network formation and approaches for the joint determination of networks and interactions mediated through those networks.
References
More filters
Book
Social Network Analysis: Methods and Applications
TL;DR: This paper presents mathematical representation of social networks in the social and behavioral sciences through the lens of Dyadic and Triadic Interaction Models, which describes the relationships between actor and group measures and the structure of networks.
Journal ArticleDOI
A Stochastic Approximation Method
Herbert Robbins,Sutton Monro +1 more
TL;DR: In this article, a method for making successive experiments at levels x1, x2, ··· in such a way that xn will tend to θ in probability is presented.
Journal ArticleDOI
Statistical Analysis of Non-Lattice Data
TL;DR: In this article, a fixed system of n sites, labelled by the first n positive integers, and an associated vector x of observations, Xi,..., Xn, which, in turn, is assumed to be a realization of a vector X of (dependent) random variables, Xi,.., Xn, X.. In practice the sites may represent points or regions in space and the random variables may be either continuous or discrete.
Journal ArticleDOI
An Exponential Family of Probability Distributions for Directed Graphs
Paul W. Holland,Samuel Leinhardt +1 more
TL;DR: An exponential family of distributions that can be used for analyzing directed graph data is described, and several special cases are discussed along with some possible substantive interpretations.
Related Papers (5)
An Exponential Family of Probability Distributions for Directed Graphs
Paul W. Holland,Samuel Leinhardt +1 more