Polynomial time perfect sampling algorithm for two‐rowed contingency tables
Polynomial time perfect sampling algorithm for two‐rowed contingency tables
复制标题
DOI：
10.1002/rsa.20087
复制
发表时间：
2006-09
影响因子：
1
通讯作者：
S. Kijima;Tomomi Matsui
中科院分区：
文献类型：
--
作者：
S. Kijima;Tomomi Matsui
本文提出了一种针对 2 × n 列联表的多项式时间完美（精确）采样算法。该算法基于过去的单调耦合（monotone CFTP）算法。预期运行时间以 O(n3 lnN) 为界，其中 n 是列数，N 是所有条目的总和。 © 2005 Wiley periodicals, Inc. 随机结构。阿尔格，2006
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 lnN) where n is the number of columns and N is the total sum of all entries. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006