Characterizing optimal sampling of binary contingency tables via the configuration model

Jose Blanchet, A Stauffer

Research output: Contribution to journalArticle

5 Citations (Scopus)
117 Downloads (Pure)

Abstract

A binary contingency table is an m × n array of binary entries with row sums r = (r1,..., rm) and column sums c = (c1,..., cn). The configuration model generates a contingency table by considering ri tokens of type 1 for each row i and cj tokens of type 2 for each column j, and then taking a uniformly random pairing between type-1 and type-2 tokens. We give a necessary and sufficient condition so that the probability that the configuration model outputs a binary contingency table remains bounded away from 0 as goes to ∞. Our finding shows surprising differences from recent results for binary symmetric contingency tables.
Original languageEnglish
Pages (from-to)159-184
Number of pages26
JournalRandom Structures and Algorithms
Volume42
Issue number2
DOIs
Publication statusPublished - 1 Mar 2013

Fingerprint Dive into the research topics of 'Characterizing optimal sampling of binary contingency tables via the configuration model'. Together they form a unique fingerprint.

  • Cite this