title: Proof of uniform sampling of binary matrices with fixed row sums and column sums for the fast Curveball algorithm.
abstract: Randomization of binary matrices has become one of the most important quantitative tools in modern computational biology. The equivalent problem of generating random directed networks with fixed degree sequences has also attracted a lot of attention. However, it is very challenging to generate truly unbiased random matrices with fixed row and column sums. Strona et al. [Nat. Commun. 5, 4114 (2014)] introduce the innovative Curveball algorithm and give numerical support for the proposition that it generates truly random matrices. In this paper, we present a rigorous proof of convergence to the uniform distribution. Furthermore, we show the Curveball algorithm must include certain failed trades to ensure uniform sampling.
authors.affiliation: School of Mathematical and Geospatial Sciences, RMIT University, Melbourne, Victoria 3000, Australia.
authors.forename: C J
authors.initials: CJ
authors.lastname: Carstens
mesh_terms: D000465:Algorithms; D008390:Markov Chains