Consistency under sampling of exponential random graph models

DOI10.1214/12-AOS1044zbMath1269.91066arXiv1111.3054OpenAlexW3103377809WikidataQ40745745 ScholiaQ40745745MaRDI QIDQ355086

Cosma Rohilla Shalizi, Alessandro Rinaldo

Publication date: 24 July 2013

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

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

zbMATH Keywords

exponential familysufficient statisticsnetwork modelsnetwork samplingindependent incrementsexponential random graph modelprojective family

Mathematics Subject Classification ID

Processes with independent increments; Lévy processes (60G51) Social networks; opinion dynamics (91D30) Non-Markovian processes: estimation (62M09) Applications of statistics to social sciences (62P25) Inference from stochastic processes (62M99) Sufficient statistics and fields (62B05)

Related Items (39)

Random Partition Models for Microclustering Tasks ⋮ Networks beyond pairwise interactions: structure and dynamics ⋮ Graphical construction of spatial Gibbs random graphs ⋮ Social network mediation analysis: a latent space approach ⋮ Inference in a probit model for affiliation networks ⋮ Bootstrapping exchangeable random graphs ⋮ Exponential random simplicial complexes ⋮ A simple and efficient algorithm for modeling modular complex networks ⋮ Edge Exchangeable Models for Interaction Networks ⋮ Minimum distance estimators of population size from snowball samples using conditional estimation and scaling of exponential random graph models ⋮ Affiliation discrete weighted networks with an increasing degree sequence ⋮ Asymptotic distribution in affiliation finite discrete weighted networks with an increasing degree sequence ⋮ Consistency under sampling of exponential random graph models ⋮ Bayesian Shrinkage for Functional Network Models, With Applications to Longitudinal Item Response Data ⋮ Concentration and consistency results for canonical and curved exponential-family models of random graphs ⋮ Practical Network Modeling via Tapered Exponential-Family Random Graph Models ⋮ Longitudinal network models and permutation‐uniform Markov chains ⋮ Projective families of distributions revisited ⋮ Limits of multi-relational graphs ⋮ Link Prediction for Egocentrically Sampled Networks ⋮ Projective, sparse and learnable latent position network models ⋮ Consistency of maximum likelihood for continuous-space network models. I ⋮ Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters ⋮ Exponential-family models of random graphs: inference in finite, super and infinite population scenarios ⋮ Crawling subsampling for multivariate spatial autoregression model in large-scale networks ⋮ A motif building process for simulating random networks ⋮ Sparse maximum-entropy random graphs with a given power-law degree distribution ⋮ Adjustable network reconstruction with applications to CDS exposures ⋮ Asymptotics in directed exponential random graph models with an increasing bi-degree sequence ⋮ A statistical framework for modern network science ⋮ Time-varying network models ⋮ Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics ⋮ Consistent structure estimation of exponential-family random graph models with block structure ⋮ Multiresolution Network Models ⋮ An introduction to large deviations for random graphs ⋮ Statistical Inference in a Directed Network Model With Covariates ⋮ Outliers and influential observations in exponential random graph models ⋮ Statistics of the two star ERGM ⋮ On the question of effective sample size in network modeling: an asymptotic inquiry

Uses Software

• statnet

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consistency under sampling of exponential random graph models
• Maximum likelihood estimation in the \(\beta\)-model
• Adjusting for network size and composition effects in exponential-family random graph models
• Applications of Stein's method for concentration inequalities
• Random graphs with a given degree sequence
• Mixing time of exponential random graphs
• Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
• Limits of dense graph sequences
• Modeling social networks from sampled data
• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
• Statistical analysis of network data. Methods and models
• Extremal families and systems of sufficient statistics
• Kepler's area law in the \textit{Principia}: filling in some details in Newton's proof of Proposition 1.
• Theory of statistics
• On the geometry of discrete exponential families with application to exponential random graph models
• Discrete temporal models of social networks
• Projective limit random probabilities on Polish spaces
• Estimating and understanding exponential random graph models
• A nonparametric view of network models and Newman–Girvan and other modularities
• Graphical Models, Exponential Families, and Variational Inference
• Graph limits and exchangeable random graphs
• Markov Graphs
• A candidate's formula: A curious result in Bayesian prediction
• The Role of Sufficiency and of Estimation in Thermodynamics
• An Exponential Family of Probability Distributions for Directed Graphs
• A Survey of Statistical Network Models
• Networks
• On the bias of traceroute sampling
• Large deviations
• Renormalization group and probability theory

This page was built for publication: Consistency under sampling of exponential random graph models