Exact sampling and counting for fixed-margin matrices
From MaRDI portal
Publication:366999
DOI10.1214/13-AOS1131zbMath1292.62083arXiv1301.6635MaRDI QIDQ366999
Jeffrey W. Miller, Matthew T. Harrison
Publication date: 25 September 2013
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.6635
62H15: Hypothesis testing in multivariate analysis
05A15: Exact enumeration problems, generating functions
62H17: Contingency tables
Related Items
Spatiotemporal Conditional Inference and Hypothesis Tests for Neural Ensemble Spiking Precision, Recursive pathways to marginal likelihood estimation with prior-sensitivity analysis, Adjustable network reconstruction with applications to CDS exposures, Bayesian conditional inference for Rasch models, Lower bounds for contingency tables via Lorentzian polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theorem on flows in networks
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- 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
- 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
- A combinatorial distribution problem
- Linear homogeneous Diophantine equations and magic labelings of graphs
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Effective lattice point counting in rational convex polytopes
- Counting Binary Matrices with Given Row and Column Sums
- Combinatorial Properties of Matrices of Zeros and Ones
- The Enumeration of Locally Restricted Graphs (I)
- Uniform generation of random regular graphs of moderate degree
- Counting the Number of r × c Contingency Tables with Fixed Margins
- Sampling contingency tables
- Fast Unimodular Counting
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- The Enumeration of Locally Restricted Graphs (II)
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Enumerative applications of symmetric functions