Adjusting for network size and composition effects in exponential-family random graph models
From MaRDI portal
Publication:545141
DOI10.1016/J.STAMET.2011.01.005zbMATH Open1215.91069arXiv1004.5328OpenAlexW3098982997WikidataQ35052375 ScholiaQ35052375MaRDI QIDQ545141FDOQ545141
Authors: Martina Morris, Pavel N. Krivitsky, Mark S. Handcock 
Publication date: 22 June 2011
Published in: Statistical Methodology (Search for Journal in Brave)
Abstract: Exponential-family random graph models (ERGMs) provide a principled way to model and simulate features common in human social networks, such as propensities for homophily and friend-of-a-friend triad closure. We show that, without adjustment, ERGMs preserve density as network size increases. Density invariance is often not appropriate for social networks. We suggest a simple modification based on an offset which instead preserves the mean degree and accommodates changes in network composition asymptotically. We demonstrate that this approach allows ERGMs to be applied to the important situation of egocentrically sampled data. We analyze data from the National Health and Social Life Survey (NHSLS).
Full work available at URL: https://arxiv.org/abs/1004.5328
Recommendations
Applications of statistics to social sciences (62P25) Random graphs (graph-theoretic aspects) (05C80) Social networks; opinion dynamics (91D30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Exponential Family of Probability Distributions for Directed Graphs
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Random graph models for temporal processes in social networks*
- Markov Graphs
Cited In (32)
- A novel simulation method for binary discrete exponential families, with application to social networks
- On the question of effective sample size in network modeling: an asymptotic inquiry
- Consistency under sampling of exponential random graph models
- A flexible parameterization for baseline mean degree in multiple-network ERGMs
- Bayesian analysis for exponential random graph models using the adaptive exchange sampler
- A statistical social network model for consumption data in trophic food webs
- On the equivalence of the edge/isolate and edge/concurrent tie ERGM families, and their extensions
- Hurdle Blockmodels for Sparse Network Modeling
- Statistical inference in a directed network model with covariates
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Outliers and influential observations in exponential random graph models
- Subgraph network random effects error components models: specification and testing
- Estimation for dyadic-dependent exponential random graph models
- A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015
- Concentration and consistency results for canonical and curved exponential-family models of random graphs
- What can mathematical models tell us about the relationship between circular migrations and HIV transmission dynamics?
- Discussion to: ``Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F. C. Stingo
- Goodness of Fit of Social Network Models
- Minimum distance estimators of population size from snowball samples using conditional estimation and scaling of exponential random graph models
- A dynamic process interpretation of the sparse ERGM reference model
- A perfect sampling method for exponential family random graph models
- Inference for social network models from egocentrically sampled data, with application to understanding persistent racial disparities in HIV prevalence in the US
- Exponential-family random graph models for valued networks
- A Tale of Two Datasets: Representativeness and Generalisability of Inference for Samples of Networks
- Online network monitoring
- Review of statistical network analysis: models, algorithms, and software
- A comparative analysis of different descriptions in exponential random graph models \((p^*)\)
- Modeling heterogeneous peer assortment effects using finite mixture exponential random graph models
- A dynamic process reference model for sparse networks with reciprocity
- Finite mixtures of ERGMs for modeling ensembles of networks
- Structure recovery and trend estimation for dynamic network analysis
- Model-based clustering of time-evolving networks through temporal exponential-family random graph models
Uses Software
This page was built for publication: Adjusting for network size and composition effects in exponential-family random graph models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545141)
