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

12/07/2021

∙

by   Karl Godard, et al.

∙

0

∙

share

Many applications require randomly sampling binary graphs with fixed degrees, or randomly sampling binary matrices with fixed row and column marginals. Although several algorithms to perform this sampling have been proposed, the “curveball” algorithm is the fastest that has been proven to sample uniformly at random. In this paper, we introduce a more efficient version of curveball called “fastball” that is roughly 8 times faster.