A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins

DOI10.1214/20-EJS1702zbMath1439.62060arXiv1904.03836MaRDI QIDQ2180075

Guanyang Wang

Publication date: 13 May 2020

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.03836

zbMATH Keywords

binary matrixMCMCMarkov chain Monte Carlo algorithmuniform samplingfixed marginsrectangle loop algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Estimation in multivariate analysis (62H12) Sampling theory, sample surveys (62D05) Monte Carlo methods (65C05)

Related Items (3)

Using Survey Sampling Algorithms For Exact Inference in Logistic Regression ⋮ ROhAN: row-order agnostic null models for statistically-sound knowledge discovery ⋮ Limiting properties of an equiprobable sampling scheme for 0-1 matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• An efficient MCMC algorithm to sample binary matrices with fixed marginals
• Enumeration and simulation methods for 0-1 matrices with given marginals
• Algebraic algorithms for sampling from conditional distributions
• On uniform generation of two-way tables with fixed margins and the conditional volume test of Diaconis and Efron
• Optimum Monte-Carlo sampling using Markov chains
• Generalized Monte Carlo significance tests
• Sequential Monte Carlo Methods for Statistical Analysis of Tables

This page was built for publication: A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins