Characterizing optimal sampling of binary contingency tables via the configuration model

Jose Blanchet, A Stauffer

Research output: Contribution to journalArticle

3 Citations (Scopus)
65 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

Contingency Table
Binary
Sampling
Configuration
Pairing
Model
Necessary Conditions
Sufficient Conditions
Output

Cite this

Characterizing optimal sampling of binary contingency tables via the configuration model. / Blanchet, Jose; Stauffer, A.

In: Random Structures and Algorithms, Vol. 42, No. 2, 01.03.2013, p. 159-184.

Research output: Contribution to journalArticle

@article{f2bc1ba5b4ed4cd59ee5377c7fb58555,
title = "Characterizing optimal sampling of binary contingency tables via the configuration model",
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.",
author = "Jose Blanchet and A Stauffer",
year = "2013",
month = "3",
day = "1",
doi = "10.1002/rsa.20403",
language = "English",
volume = "42",
pages = "159--184",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Inc.",
number = "2",

}

TY - JOUR

T1 - Characterizing optimal sampling of binary contingency tables via the configuration model

AU - Blanchet, Jose

AU - Stauffer, A

PY - 2013/3/1

Y1 - 2013/3/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=84873082616&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1002/rsa.20403

U2 - 10.1002/rsa.20403

DO - 10.1002/rsa.20403

M3 - Article

VL - 42

SP - 159

EP - 184

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 2

ER -