Estimating and understanding exponential random graph models

DOI10.1214/13-AOS1155zbMath1293.62046arXiv1102.2650WikidataQ105584281 ScholiaQ105584281MaRDI QIDQ2438758

Persi Diaconis, Sourav Chatterjee

Publication date: 6 March 2014

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.2650

zbMATH Keywords

parameter estimation; random graph; graph limit; exponential random graph models; Erdős-Rényi

Mathematics Subject Classification ID

62P25: Applications of statistics to social sciences

62F10: Point estimation

05C80: Random graphs (graph-theoretic aspects)

60F10: Large deviations

Related Items

Edge Exchangeable Models for Interaction Networks, The phases of large networks with edge and triangle constraints, Configuring Random Graph Models with Fixed Degree Sequences, On the asymptotics of constrained exponential random graphs, Review of statistical network analysis: models, algorithms, and software, Local Graph Stability in Exponential Family Random Graph Models, Inference in a probit model for affiliation networks, Testing for Equivalence of Network Distribution Using Subgraph Counts, Weighted directed networks with a differentially private bi-degree sequence, A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015, A note on perfect simulation for Exponential Random Graph Models, Maximum likelihood estimation for discrete exponential families and random graphs, On the phase transition curve in a directed exponential random graph model, Limit theorems for monochromatic stars, Asymptotic Structure for the Clique Density Theorem, Statistical Inference in a Directed Network Model With Covariates, Asymptotic Structure of Graphs with the Minimum Number of Triangles, On the Lower Tail Variational Problem for Random Graphs, Exactly solvable random graph ensemble with extensively many short cycles, Unnamed Item, Asymptotics in directed exponential random graph models with an increasing bi-degree sequence, Imaginary replica analysis of loopy regular random graphs, The birth of geometry in exponential random graphs, Nonparametric discriminant analysis with network structures in predictor, Graphical construction of spatial Gibbs random graphs, Longitudinal network models and permutation‐uniform Markov chains, Parameter estimation in a 3‐parameter p‐star random graph model, Fluctuations of subgraph counts in graphon based random graphs, Metastable mixing of Markov chains: efficiently sampling low temperature exponential random graphs, Typical large graphs with given edge and triangle densities, The large deviation principle for inhomogeneous Erdős-Rényi random graphs, Link Prediction for Egocentrically Sampled Networks, Graphon mean field systems, On the question of effective sample size in network modeling: an asymptotic inquiry, A detailed investigation into near degenerate exponential random graphs, Consistency under sampling of exponential random graph models, Phase transitions in exponential random graphs, Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters, Asymptotic structure and singularities in constrained directed graphs, The polytope of \(k\)-star densities, The method of moments and degree distributions for network models, Large-scale estimation of random graph models with local dependence, On the growth rate of a linear stochastic recursion with Markovian dependence, Reciprocity in directed networks, Bayesian variable selection for correlated covariates via colored cliques, Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations, Weighted exponential random graph models: scope and large network limits, Exponential random graphs behave like mixtures of stochastic block models, Spatial Gibbs random graphs, The sample size required in importance sampling, Asymptotics for the Euler-discretized Hull-White stochastic volatility model, Error bounds for sequential Monte Carlo samplers for multimodal distributions, Testing goodness of fit of random graph models, Ensemble equivalence for dense graphs, Decomposition of mean-field Gibbs distributions into product measures, Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality, Sparse maximum-entropy random graphs with a given power-law degree distribution, The local structure of globalization, Concentration inequalities for bounded functionals via log-Sobolev-type inequalities, Modified log-Sobolev inequalities, Beckner inequalities and moment estimates, Statistics of the two star ERGM, Motif estimation via subgraph sampling: the fourth-moment phenomenon, Continuum and thermodynamic limits for a simple random-exchange model, Dimension reduction in vertex-weighted exponential random graphs, Discussion to: \textit{Bayesian graphical models for modern biological applications} by Y. Ni, V. Baladandayuthapani, M. Vannucci and F.C. Stingo, Upper tails via high moments and entropic stability, Large deviation for uniform graphs with given degrees, Logarithmic Sobolev inequalities for finite spin systems and applications, Concentration and consistency results for canonical and curved exponential-family models of random graphs, Replica symmetry in upper tails of mean-field hypergraphs, Modeling heterogeneous peer assortment effects using finite mixture exponential random graph models, Phase transitions in finite random networks, Exponential-family models of random graphs: inference in finite, super and infinite population scenarios, Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph, Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs, Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics, Consistent structure estimation of exponential-family random graph models with block structure, Mixing time of vertex-weighted exponential random graphs, Monochromatic subgraphs in randomly colored graphons, Dynamic stochastic block models: parameter estimation and detection of changes in community structure, Matrix estimation by universal singular value thresholding, Singularities in the entropy of asymptotically large simple graphs, Differential calculus on graphon space, Nonparametric statistics of dynamic networks with distinguishable nodes, Asymptotic structure of constrained exponential random graph models, Multipodal structure and phase transitions in large constrained graphs, Critical phenomena in exponential random graphs, Evolution of social networks, Nonlinear large deviations, An introduction to large deviations for random graphs, Emergent Structures in Large Networks, Ensemble nonequivalence in random graphs with modular structure, Lattice gas models with long range interactions, Ground states for exponential random graphs, Vertex Order in Some Large Constrained Random Graphs, On replica symmetry of large deviations in random graphs, Perspectives on exponential random graphs, Multiresolution Network Models, Exponential random simplicial complexes, Breaking of ensemble equivalence for dense random graphs under a single constraint, Spectral Estimation of Large Stochastic Blockmodels with Discrete Nodal Covariates

Uses Software

• tsbridge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Phase transitions in exponential random graphs
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Equi-energy sampler with applications in statistical inference and statistical mechanics
• Applications of Stein's method for concentration inequalities
• Testing properties of graphs and functions
• Random graphs with a given degree sequence
• The large deviation principle for the Erdős-Rényi random graph
• Mixing time of exponential random graphs
• Limits of dense graph sequences
• Szemerédi's lemma for the analyst
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• On exchangeable random variables and the statistics of large graphs and hypergraphs
• Quick approximation to matrices and applications
• Representations for partially exchangeable arrays of random variables
• Correlation inequalities on some partially ordered sets
• On the geometry of discrete exponential families with application to exponential random graph models
• Critical phenomena in exponential random graphs
• Generalized quasirandom graphs
• Estimation in spin glasses: a first step
• The rank of connection matrices and the dimension of graph algebras
• Phase transitions in a complex network
• Emergent Structures in Large Networks
• Testability and repair of hereditary hypergraph properties
• On replica symmetry of large deviations in random graphs
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Graph limits and exchangeable random graphs
• Contractors and connectors of graph algebras
• Metrics for sparse graphs
• Markov Graphs
• On a General Class of Models for Interaction
• An Exponential Family of Probability Distributions for Directed Graphs
• A central limit theorem for conditionally centred random fields with an application to Markov fields
• Phase transition in the random triangle model
• Probabilistic Symmetries and Invariance Principles
• A Stochastic Approximation Method
• On the structure of linear graphs
• Simulating normalizing constants: From importance sampling to bridge sampling to path sampling