A novel simulation method for binary discrete exponential families, with application to social networks
From MaRDI portal
Publication:3458640
DOI10.1080/0022250X.2015.1022279zbMATH Open1331.91147OpenAlexW1544701365WikidataQ41848989 ScholiaQ41848989MaRDI QIDQ3458640FDOQ3458640
Authors: Carter T. Butts
Publication date: 21 December 2015
Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0022250x.2015.1022279
Recommendations
- Approximate Bayesian computation for exponential random graph models for large social networks
- Adjusting for network size and composition effects in exponential-family random graph models
- Auxiliary parameter MCMC for exponential random graph models
- A perfect sampling method for exponential family random graph models
- Bayesian analysis for exponential random graph models using the adaptive exchange sampler
Cites Work
Cited In (6)
- On the equivalence of the edge/isolate and edge/concurrent tie ERGM families, and their extensions
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Graphical construction of spatial Gibbs random graphs
- A perfect sampling method for exponential family random graph models
- A dynamic process reference model for sparse networks with reciprocity
- Structure recovery and trend estimation for dynamic network analysis
Uses Software
This page was built for publication: A novel simulation method for binary discrete exponential families, with application to social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3458640)