A note on parallel sampling in Markov graphs
From MaRDI portal
Publication:2319481
DOI10.1007/S00180-019-00880-4zbMATH Open1505.62053OpenAlexW2921608956MaRDI QIDQ2319481FDOQ2319481
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
Recommendations
Computational methods for problems pertaining to statistics (62-08) Random graphs (graph-theoretic aspects) (05C80)
Cites Work
- A survey of statistical network models
- 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
- Title not available (Why is that?)
- An Exponential Family of Probability Distributions for Directed Graphs
- Title not available (Why is that?)
- Instability, sensitivity, and degeneracy of discrete exponential families
- Markov Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mixing time of exponential random graphs
- Conditional marginalization for exponential random graph models
- Conditional estimation of exponential random graph models from snowball sampling designs
Cited In (3)
Uses Software
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)