### 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(n^{3} ln N) where n is the number of columns and N is the total sum of all entries.

Original language | English |
---|---|

Pages (from-to) | 243-256 |

Number of pages | 14 |

Journal | Random Structures and Algorithms |

Volume | 29 |

Issue number | 2 |

DOIs | |

Publication status | Published - Sep 1 2006 |

Externally published | Yes |

### Fingerprint

### All Science Journal Classification (ASJC) codes

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

### Cite this

*Random Structures and Algorithms*,

*29*(2), 243-256. https://doi.org/10.1002/rsa.20087

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

Research output: Contribution to journal › Article

*Random Structures and Algorithms*, vol. 29, no. 2, pp. 243-256. https://doi.org/10.1002/rsa.20087

}

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 -