Improved Bounds for Sampling Contingency Tables


We study the problem of sampling contingency tables (nonnegative integer matrices with specified row and column sums) uniformly at random. We give an algorithm which runs in polynomial time provided that the row sums ri and the column sums cj satisfy ri (n 3/ m log m), and cj (m 3/ n log n). This algorithm is based on a reduction to continuous sampling from… (More)
DOI: 10.1007/978-3-540-48413-4_12


  • Presentations referencing similar topics