State-Dependent Kernel Selection for Conditional Sampling of Graphs
From MaRDI portal
Cites work
- A sequential algorithm for generating random graphs
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- A survey of exact inference for contingency tables. With comments and a rejoinder by the author
- Algebraic algorithms for sampling from conditional distributions
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- An Exponential Family of Probability Distributions for Directed Graphs
- Community structure in social and biological networks
- Enumeration and simulation methods for 0-1 matrices with given marginals
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 1089130 (Why is no real title available?)
- scientific article; zbMATH DE number 6107964 (Why is no real title available?)
- Introduction to algorithms.
- Markov bases and structural zeros
- Markov chain Monte Carlo exact tests for incomplete two-way contingency tables
- Sampling for conditional inference on network data
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- The Analysis of Cross-Classified Data: Independence, Quasi-Independence, and Interactions in Contingency Tables with or Without Missing Entries
This page was built for publication: State-Dependent Kernel Selection for Conditional Sampling of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066753)