DeepAI AI Chat
Log In Sign Up

A Fast Scheme for the Uniform Sampling of Binary Matrices with Fixed Margins

04/08/2019
by   Guanyang Wang, et al.
0

Uniform sampling of binary matrix with fixed margins is an important and difficult problem in statistics, computer science, ecology and so on. The well-known swap algorithm would be inefficient when the size of the matrix becomes large or when the matrix is too sparse/full. Here we propose the Rectangle loop algorithm, a Markov-chain Monte Carlo algorithm to sample binary matrices with fixed margins uniformly. Theoretically the Rectangle loop algorithm is better than the swap algorithm in Peskun's order. Empirically studies also demonstrates the Rectangle loop algorithm is remarkablely more efficient than the swap algorithm.

READ FULL TEXT

page 10

page 11

page 13

04/08/2019

A Fast MCMC for the Uniform Sampling of Binary Matrices with Fixed Margins

Uniform sampling of binary matrix with fixed margins is an important and...
09/02/2018

A fast Metropolis-Hastings method for generating random correlation matrices

We propose a novel Metropolis-Hastings algorithm to sample uniformly fro...
12/07/2021

fastball: A fast algorithm to sample binary matrices with fixed marginals

Many applications require randomly sampling binary graphs with fixed deg...
04/14/2021

Novel Matrix Hit and Run for Sampling Polytopes and Its GPU Implementation

We propose and analyze a new Markov Chain Monte Carlo algorithm that gen...
04/19/2021

Linear-time uniform generation of random sparse contingency tables with specified marginals

We give an algorithm that generates a uniformly random contingency table...
07/29/2020

Non-Uniform Sampling of Fixed Margin Uniform Matrices

Data sets in the form of binary matrices are ubiquitous across scientifi...
03/21/2018

A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation

In high performance computing, scheduling of tasks and allocation to mac...