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
A Multilayered Block Network Model to Forecast Large Dynamic Transportation Graphs: an Application to US Air Transport
TL;DR: This paper introduces a dynamic multilayer block network model with a latent space representation for blocks rather than nodes, which is natural for many real networks, such as social or transportation networks, where community structure naturally arise.
Journal ArticleDOI
Imaginary replica analysis of loopy regular random graphs
TL;DR: In this paper, an analytical approach for describing spectrally constrained maximum entropy ensembles of finitely connected regular loopy graphs, valid in the regime of weak loop-loop interactions, is presented.
Journal ArticleDOI
Atomic subgraphs and the statistical mechanics of networks.
TL;DR: In this paper, the authors develop random graph models where graphs are generated by connecting not only pairs of vertices by edges, but also larger subsets of nodes by copies of small atomic subgraphs of arbitrary topology.
Journal ArticleDOI
Graphical Models Over Heterogeneous Domains and for Multilevel Networks
Tamara Dimitrova,Ljupco Kocarev +1 more
TL;DR: Models for analyzing multivariate data of mixed (heterogeneous) domains such as binary, categorical, ordinal, counts, continuous, and/or skewed continuous and methods for modeling various graphs including multiplex, multilevel, and multilayer networks are reviewed.
Posted Content
Monochromatic Subgraphs in Randomly Colored Graphons
TL;DR: In this article, a complete characterization of the limiting distribution of monochromatic copies of a fixed connected graph in a uniformly random coloring of the vertices of the graph $G_n$ is given.
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