DeepAI AI Chat
Log In Sign Up

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

by   Andrii Arman, et al.

We give an algorithm that generates a uniformly random contingency table with specified marginals, i.e. a matrix with non-negative integer values and specified row and column sums. Such algorithms are useful in statistics and combinatorics. When Δ^4< M/5, where Δ is the maximum of the row and column sums and M is the sum of all entries of the matrix, our algorithm runs in time linear in M in expectation. Most previously published algorithms for this problem are approximate samplers based on Markov chain Monte Carlo, whose provable bounds on the mixing time are typically polynomials with rather large degrees.


page 1

page 2

page 3

page 4


Random Transpositions on Contingency Tables

Contingency tables are useful objects in statistics for representing 2-w...

Improved estimates for the number of non-negative integer matrices with given row and column sums

The number of non-negative integer matrices with given row and column su...

Construction and Random Generation of Hypergraphs with Prescribed Degree and Dimension Sequences

We propose algorithms for construction and random generation of hypergra...

Mixing time for uniform sampling of binary matrices with fixed row and column sums using the trade algorithm

The trade algorithm, which includes the curveball and fastball implement...

Load Plus Communication Balancing in Contiguous Partitions for Distributed Sparse Matrices: Linear-Time Algorithms

We study partitioning to parallelize multiplication of one or more dense...

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...

Elimination-based certificates for triangular equivalence and rank profiles

In this paper, we give novel certificates for triangular equivalence and...