Exact sampling and counting for fixed-margin matrices
From MaRDI portal
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.
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
Cites work
- scientific article; zbMATH DE number 3877221 (Why is no real title available?)
- scientific article; zbMATH DE number 4112600 (Why is no real title available?)
- scientific article; zbMATH DE number 795108 (Why is no real title available?)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A combinatorial distribution problem
- A reduced formula for the precise number of (0, 1)-matrices in \({\mathcal A}\)(R, S)
- A theorem on flows in networks
- Algebraic unimodular counting
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Combinatorial Properties of Matrices of Zeros and Ones
- Counting Binary Matrices with Given Row and Column Sums
- Counting the Number of r × c Contingency Tables with Fixed Margins
- Effective lattice point counting in rational convex polytopes
- Enumerative applications of symmetric functions
- Fast Unimodular Counting
- Linear homogeneous Diophantine equations and magic labelings of graphs
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- On uniform generation of two-way tables with fixed margins and the conditional volume test of Diaconis and Efron
- Sampling contingency tables
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Symmetric functions and P-recursiveness
- Testing for independence in a two-way table: New interpretations of the chi-square statistic
- The Ehrhart polynomial of the Birkhoff polytope
- The Enumeration of Locally Restricted Graphs (I)
- The Enumeration of Locally Restricted Graphs (II)
- Uniform generation of random regular graphs of moderate degree
Cited in
(10)- Linear-time uniform generation of random sparse contingency tables with specified marginals
- Battleship, tomography and quantum annealing
- Comparing QUBO models for quantum annealing: integer encodings for permutation problems
- A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins
- Recursive pathways to marginal likelihood estimation with prior-sensitivity analysis
- Spatiotemporal conditional inference and hypothesis tests for neural ensemble spiking precision
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- Bayesian conditional inference for Rasch models
- Lower bounds for contingency tables via Lorentzian polynomials
- Adjustable network reconstruction with applications to CDS exposures
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)
