On the question of effective sample size in network modeling: an asymptotic inquiry
From MaRDI portal
Publication:254438
DOI10.1214/14-STS502zbMath1332.62036arXiv1112.0840OpenAlexW3100871681WikidataQ35794640 ScholiaQ35794640MaRDI QIDQ254438
Eric D. Kolaczyk, Pavel N. Krivitsky
Publication date: 8 March 2016
Published in: Statistical Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.0840
consistencyasymptotic normalitymaximum likelihoodexponential-family random graph modelmutualitytriadic closure
Related Items (15)
A dynamic process interpretation of the sparse ERGM reference model ⋮ Discussion to: \textit{Bayesian graphical models for modern biological applications} by Y. Ni, V. Baladandayuthapani, M. Vannucci and F.C. Stingo ⋮ A dynamic process reference model for sparse networks with reciprocity ⋮ Minimum distance estimators of population size from snowball samples using conditional estimation and scaling of exponential random graph models ⋮ Concentration and consistency results for canonical and curved exponential-family models of random graphs ⋮ A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015 ⋮ Maximum likelihood estimation based on the Laplace approximation for p2 network regression models ⋮ Finite mixtures of ERGMs for modeling ensembles of networks ⋮ Rejoinder to Discussion of “A Tale of Two Datasets: Representativeness and Generalisability of Inference for Samples of Networks” ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Exponential-family models of random graphs: inference in finite, super and infinite population scenarios ⋮ Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics ⋮ Consistent structure estimation of exponential-family random graph models with block structure ⋮ Online network monitoring ⋮ On the question of effective sample size in network modeling: an asymptotic inquiry
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the question of effective sample size in network modeling: an asymptotic inquiry
- 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
- Random graphs with a given degree sequence
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical analysis of network data. Methods and models
- Interval estimation for a binomial proportion. (With comments and a rejoinder).
- Effective sample size: quick estimation of the effect of related samples in genetic case-control association analyses
- Confidence intervals for a binomial proportion and asymptotic expansions
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Discrete temporal models of social networks
- Estimating and understanding exponential random graph models
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Instability, Sensitivity, and Degeneracy of Discrete Exponential Families
- Markov Graphs
- An Exponential Family of Probability Distributions for Directed Graphs
- Asymptotic Statistics
- A Survey of Statistical Network Models
- Networks
This page was built for publication: On the question of effective sample size in network modeling: an asymptotic inquiry