Polynomial time perfect sampling algorithm for two-rowed contingency tables

Shuji Kijima, Tomomi Matsui

Research output: Contribution to journalArticle

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

Fingerprint

Perfect Sampling
Contingency Table
Polynomial time
Polynomials
Sampling
Coupling from the Past
Monotone

All Science Journal Classification (ASJC) codes

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

Cite this

Polynomial time perfect sampling algorithm for two-rowed contingency tables. / Kijima, Shuji; Matsui, Tomomi.

In: Random Structures and Algorithms, Vol. 29, No. 2, 01.09.2006, p. 243-256.

Research output: Contribution to journalArticle

@article{902a909bb1584ee5b8f660a8b4788500,
title = "Polynomial time perfect sampling algorithm for two-rowed contingency tables",
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.",
author = "Shuji Kijima and Tomomi Matsui",
year = "2006",
month = "9",
day = "1",
doi = "10.1002/rsa.20087",
language = "English",
volume = "29",
pages = "243--256",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "2",

}

TY - JOUR

T1 - Polynomial time perfect sampling algorithm for two-rowed contingency tables

AU - Kijima, Shuji

AU - Matsui, Tomomi

PY - 2006/9/1

Y1 - 2006/9/1

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

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

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

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

U2 - 10.1002/rsa.20087

DO - 10.1002/rsa.20087

M3 - Article

AN - SCOPUS:33748422029

VL - 29

SP - 243

EP - 256

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 2

ER -