A note on parallel sampling in Markov graphs

DOI10.1007/s00180-019-00880-4zbMath1505.62053OpenAlexW2921608956MaRDI QIDQ2319481

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

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

Markov chain Monte Carloparallel computingnetwork dataexponential random graph model

Mathematics Subject Classification ID

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

Related Items (1)

pergm

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixing time of exponential random graphs
• Statistical analysis of network data. Methods and models
• Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
• Outliers and influential observations in exponential random graph models
• Conditional estimation of exponential random graph models from snowball sampling designs
• Conditional Marginalization for Exponential Random Graph Models
• Instability, Sensitivity, and Degeneracy of Discrete Exponential Families
• Markov Graphs
• An Exponential Family of Probability Distributions for Directed Graphs
• A Survey of Statistical Network Models

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