Exact sampling and counting for fixed-margin matrices
From MaRDI portal
Publication:366999
DOI10.1214/13-AOS1131zbMATH Open1292.62083arXiv1301.6635MaRDI QIDQ366999FDOQ366999
Authors: Jeffrey W. Miller, Matthew T. Harrison 
Publication date: 25 September 2013
Published in: The Annals of Statistics (Search for Journal in Brave)
Abstract: The uniform distribution on matrices with specified row and column sums is often a natural choice of null model when testing for structure in two-way tables (binary or nonnegative integer). Due to the difficulty of sampling from this distribution, many approximate methods have been developed. We will show that by exploiting certain symmetries, exact sampling and counting is in fact possible in many nontrivial real-world cases. We illustrate with real datasets including ecological co-occurrence matrices and contingency tables.
Full work available at URL: https://arxiv.org/abs/1301.6635
Recommendations
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins
- Sampling contingency tables
- Random sampling of contingency tables via probabilistic divide-and-conquer
- Improved bounds for sampling contingency tables
Hypothesis testing in multivariate analysis (62H15) Contingency tables (62H17) Exact enumeration problems, generating functions (05A15)
Cites Work
- Effective lattice point counting in rational convex polytopes
- The Ehrhart polynomial of the Birkhoff polytope
- Title not available (Why is that?)
- A theorem on flows in networks
- Symmetric functions and P-recursiveness
- A combinatorial distribution problem
- Linear homogeneous Diophantine equations and magic labelings of graphs
- Fast Unimodular Counting
- Combinatorial Properties of Matrices of Zeros and Ones
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Testing for independence in a two-way table: New interpretations of the chi-square statistic
- Sampling contingency tables
- Algebraic unimodular counting
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S)
- On uniform generation of two-way tables with fixed margins and the conditional volume test of Diaconis and Efron
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Counting Binary Matrices with Given Row and Column Sums
- The Enumeration of Locally Restricted Graphs (I)
- Title not available (Why is that?)
- Uniform generation of random regular graphs of moderate degree
- Title not available (Why is that?)
- Counting the Number of r × c Contingency Tables with Fixed Margins
- The Enumeration of Locally Restricted Graphs (II)
- Enumerative applications of symmetric functions
Cited In (9)
- Recursive pathways to marginal likelihood estimation with prior-sensitivity analysis
- Linear-time uniform generation of random sparse contingency tables with specified marginals
- Adjustable network reconstruction with applications to CDS exposures
- Comparing QUBO models for quantum annealing: integer encodings for permutation problems
- Battleship, tomography and quantum annealing
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- Lower bounds for contingency tables via Lorentzian polynomials
- Spatiotemporal Conditional Inference and Hypothesis Tests for Neural Ensemble Spiking Precision
- Bayesian conditional inference for Rasch models
Uses Software
This page was built for publication: Exact sampling and counting for fixed-margin matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q366999)
