State-Dependent Kernel Selection for Conditional Sampling of Graphs
From MaRDI portal
Publication:5066753
DOI10.1080/10618600.2020.1753529OpenAlexW3017309841MaRDI QIDQ5066753
Publication date: 30 March 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.06758
Cites Work
- A sequential algorithm for generating random graphs
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- Enumeration and simulation methods for 0-1 matrices with given marginals
- A survey of exact inference for contingency tables. With comments and a rejoinder by the author
- Algebraic algorithms for sampling from conditional distributions
- Negative examples for sequential importance sampling of binary contingency tables
- Markov bases and structural zeros
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- An Exponential Family of Probability Distributions for Directed Graphs
- Community structure in social and biological networks
- Sampling for Conditional Inference on Network Data
- The Analysis of Cross-Classified Data: Independence, Quasi-Independence, and Interactions in Contingency Tables with or Without Missing Entries
- Markov chain Monte Carlo exact tests for incomplete two-way contingency tables
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: State-Dependent Kernel Selection for Conditional Sampling of Graphs