Polynomial time perfect sampling algorithm for two-rowed contingency tables

Shuji Kijima, Tomomi Matsui

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

Abstract

This paper proposes a polynomial time perfect (exact) sampling algorithm for 2 × n contingency tables. The algorithm is based on monotone coupling from the past (monotone CFTP) algorithm. The expected running time is bounded by O(n3 ln N) where n is the number of columns and N is the total sum of all entries.

Original languageEnglish
Pages (from-to)243-256
Number of pages14
JournalRandom Structures and Algorithms
Volume29
Issue number2
DOIs
Publication statusPublished - Sep 1 2006
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Polynomial time perfect sampling algorithm for two-rowed contingency tables'. Together they form a unique fingerprint.

Cite this