Linear-time uniform generation of random sparse contingency tables with specified marginals

Analysis of algorithms (68W40) Random matrices (probabilistic aspects) (60B20) Contingency tables (62H17) Approximation algorithms (68W25) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Exact sampling and counting for fixed-margin matrices
A sequential algorithm for generating random graphs
Fast uniform generation of regular graphs
An efficient MCMC algorithm to sample binary matrices with fixed marginals
Random generation of combinatorial structures from a uniform distribution
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
Polynomial-time counting and sampling of two-rowed contingency tables
Negative examples for sequential importance sampling of binary contingency tables
Efficient importance sampling for binary contingency tables
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
Uniform generation of random regular graphs of moderate degree
Approximate counting by dynamic programming
Counting the 10-point graphs by partition
Sampling contingency tables
Uniform generation of random graphs with power-law degree sequences
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
[https://portal.mardi4nfdi.de/wiki/Publication:4705324 Random generation of 2�n contingency tables]
Generating Random Regular Graphs Quickly
Improved bounds for sampling contingency tables
On sampling with Markov chains
Uniform Generation of Random Regular Graphs
The switch Markov chain for sampling irregular graphs (Extended Abstract)
Statistical Analysis of Contingency Tables
Sampling Regular Graphs and a Peer-to-Peer Network
Sequential Monte Carlo Methods for Statistical Analysis of Tables
Generating random regular graphs
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
Fast uniform generation of random graphs with given degree sequences

This page was built for publication: Linear-time uniform generation of random sparse contingency tables with specified marginals