Linear-time uniform generation of random sparse contingency tables with specified marginals
From MaRDI portal
Publication:6590451
DOI10.1214/23-AAP2013MaRDI QIDQ6590451FDOQ6590451
Authors: Andrii Arman, Pu Gao, Nicholas Wormald
Publication date: 21 August 2024
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Contingency tables (62H17) Random matrices (probabilistic aspects) (60B20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20) Analysis of algorithms (68W40) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact sampling and counting for fixed-margin matrices
- Random generation of combinatorial structures from a uniform distribution
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Title not available (Why is that?)
- Fast uniform generation of regular graphs
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- Approximate counting by dynamic programming
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
- Negative examples for sequential importance sampling of binary contingency tables
- Title not available (Why is that?)
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- Sampling contingency tables
- Generating Random Regular Graphs Quickly
- Improved bounds for sampling contingency tables
- Generating random regular graphs
- On sampling with Markov chains
- Uniform generation of random regular graphs of moderate degree
- Efficient importance sampling for binary contingency tables
- Title not available (Why is that?)
- Random generation of 2�n contingency tables
- Sampling Regular Graphs and a Peer-to-Peer Network
- A sequential algorithm for generating random graphs
- Polynomial-time counting and sampling of two-rowed contingency tables
- Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
- The switch Markov chain for sampling irregular graphs (Extended Abstract)
- Uniform generation of random graphs with power-law degree sequences
- Uniform Generation of Random Regular Graphs
- Title not available (Why is that?)
- Fast uniform generation of random graphs with given degree sequences
- Statistical Analysis of Contingency Tables
- Counting the 10-point graphs by partition
This page was built for publication: Linear-time uniform generation of random sparse contingency tables with specified marginals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6590451)