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
Longitudinal network models and permutation-uniform Markov chains
TL;DR: In this article, a general approach to modeling longitudinal network data, including exponential random graph models (ERGMs), that vary according to certain discrete-time Markov chains, is proposed, which simplifies analysis of some network and autoregressive models from the literature.
Journal ArticleDOI
Fluctuations of subgraph counts in graphon based random graphs
TL;DR: In this paper , the authors introduced the notion of $H$ -regularity of graphons and showed that if the graphon $W$ is not a regular graph, then the Gaussian fluctuations are of order $n^{|V(H)|-1}$ and the limiting distribution of $X_n(H, W)$ can have both Gaussian and non-Gaussian components, where the nonGaussian component is a (possibly) infinite weighted sum of centred chi-squared random variables with the weights determined by the spectral properties of a graphon derived from a graph on a random graph.
Posted Content
A Stein Goodness of fit Test for Exponential Random Graph Models
Wenkai Xu,Gesine Reinert +1 more
TL;DR: In this article, a nonparametric goodness of fit testing procedure for exchangeable exponential random graph models (ERGMs) when a single network realisation is observed is proposed and the test determines how likely it is that the observation is generated from a target unnormalised ERGM density.
Journal ArticleDOI
Lattice Gas Models with Long Range Interactions
David Aristoff,Lingjiong Zhu +1 more
TL;DR: In this article, a variational principle for the entropy of a microcanonical lattice gas model with long range interactions, including power law interactions, has been obtained and the entropy is non-differentiable along a certain curve.
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