A perfect sampling method for exponential family random graph models
From MaRDI portal
Recommendations
- A note on perfect simulation for exponential random graph models
- Consistency under sampling of exponential random graph models
- Exact sampling of graphs with prescribed degree correlations
- Sampling and estimation for (sparse) exchangeable graphs
- Conditional estimation of exponential random graph models from snowball sampling designs
- Estimating and understanding exponential random graph models
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Bayesian analysis for exponential random graph models using the adaptive exchange sampler
- Sampling perspectives on sparse exchangeable graphs
- Exact sampling from perfect matchings of dense regular bipartite graphs
Cites work
- A novel simulation method for binary discrete exponential families, with application to social networks
- Adjusting for network size and composition effects in exponential-family random graph models
- An Exponential Family of Probability Distributions for Directed Graphs
- Behaviour of the Gibbs sampler when conditional distributions are potentially incompatible
- Collective dynamics of `small-world' networks
- Emergence of Scaling in Random Networks
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- scientific article; zbMATH DE number 3576455 (Why is no real title available?)
- scientific article; zbMATH DE number 1081478 (Why is no real title available?)
- scientific article; zbMATH DE number 840151 (Why is no real title available?)
- Instability, sensitivity, and degeneracy of discrete exponential families
- Latent Space Approaches to Social Network Analysis
- Local dependence in random graph models: characterization, properties and statistical inference
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Markov Graphs
- Mixing time of exponential random graphs
- On a General Class of Models for Interaction
- Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
- Phase transition in the random triangle model
- The random triangle model
- The Structure and Function of Complex Networks
Cited in
(14)- Using contrastive divergence to seed Monte Carlo MLE for exponential-family random graph models
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Bayesian model selection for high-dimensional Ising models, with applications to educational data
- Scalable and exact sampling method for probabilistic generative graph models
- A note on parallel sampling in Markov graphs
- Simulating Markov Random Fields With a Conclique-Based Gibbs Sampler
- A novel simulation method for binary discrete exponential families, with application to social networks
- A dynamic process reference model for sparse networks with reciprocity
- A note on perfect simulation for exponential random graph models
- Structure recovery and trend estimation for dynamic network analysis
- Mixing time of exponential random graphs
- A Bayesian multilevel model for populations of networks using exponential-family random graphs
- A return to biased nets: new specifications and approximate Bayesian Inference*
- Bayesian analysis of social influence
This page was built for publication: A perfect sampling method for exponential family random graph models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033313)
