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
Posted Content
Large subgraphs in pseudo-random graphs
TL;DR: In this paper, it was shown that the number of induced isomorphic copies of subgraphs of size $s$ are approximately the same as that of an Erd\H{o}s-R\'{e}yni random graph with edge connectivity probability $p$ as long as $s \le (((1-delta)\wedge \frac{1}{2})-o(1))\log n/\log (1/p)$, when $p \in (0,1/2]$.
Journal ArticleDOI
A cluster expansion approach to exponential random graph models
TL;DR: In this article, the authors show that any exponential random graph model may alternatively be viewed as a lattice gas model with a finite Banach space norm and derive a convergent power series expansion for the limiting free energy in the case of small parameters.
Journal ArticleDOI
A note on perfect simulation for Exponential Random Graph Models
TL;DR: A perfect simulation algorithm for the Exponential Random Graph Model, based on the Coupling From The Past method of Propp & Wilson (1996), is proposed and the monotonicity of the ERGM is proved for a subset of the parametric space.
Posted Content
Statistical models for cores decomposition of an undirected random graph
TL;DR: These algorithms provide first fundamental steps necessary for solving the following problems: parameter estimation in this ERGM, extending the model to its Bayesian relative, and developing a rigorous methodology for testing goodness of fit of the model and model selection.
Posted Content
Sub-critical Exponential random graphs: concentration of measure and some applications
Shirshendu Ganguly,Kyeongsik Nam +1 more
TL;DR: In this paper, the authors established a series of new concentration of measure results for the exponential random graph model throughout the entire subcritical phase, including a Poincare inequality, Gaussian concentration for Lipschitz functions, and a central limit theorem.
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