A note on parallel sampling in Markov graphs

DOI10.1007/S00180-019-00880-4MaRDI QIDQ2319481zbMATH OpenOpenAlexFDO

Authors Verena Bauer, Karl Fürlinger, Göran Kauermann

Publication date 19 August 2019

Published in Computational Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00180-019-00880-4

zbMATH Keywords

exponential random graph modelMarkov chain Monte Carlonetwork dataparallel computing

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Computational methods for problems pertaining to statistics (62-08)

Recommendations

• Auxiliary parameter MCMC for exponential random graph models
• A perfect sampling method for exponential family random graph models
• Approximate Bayesian computation for exponential random graph models for large social networks
• Parallel exact sampling and evaluation of Gaussian Markov random fields

Cites work

• A survey of statistical network models
• An Exponential Family of Probability Distributions for Directed Graphs
• Conditional estimation of exponential random graph models from snowball sampling designs
• Conditional marginalization for exponential random graph models
• Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
• scientific article; zbMATH DE number 3423418 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 1782878 (Why is no real title available?)
• scientific article; zbMATH DE number 839542 (Why is no real title available?)
• Instability, sensitivity, and degeneracy of discrete exponential families
• Markov Graphs
• Mixing time of exponential random graphs
• Outliers and influential observations in exponential random graph models
• Statistical analysis of network data. Methods and models

Cited in

(3)

• pergm
• Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks
• Large-scale estimation of random graph models with local dependence

Describes a project that uses

Uses Software

• Snow
• SNAP
• snow
• R
• ergm
• statnet
• Rcpp
• GitHub

This page was built for publication: A note on parallel sampling in Markov graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2319481)