For example, consider a spreadsheet with the potential for 100,000 rows by 20,000 columns. If we attempt to use a matrix to hold the spreadsheet, we require a great deal of memory.

Available methods to randomize binary matrices with fixed row and column sums are computationally intensive and tend to generate matrix configurations with unequal frequency. Here, the authors ...