Polynomial time perfect sampling algorithm for two-rowed contingency tables (Supported by Superrobust Computation Project of the 21st Century COE Program “Information Science and Technology Strategic Core.”)

  • Authors:

  • Shuji Kijima;Tomomi Matsui

  • Affiliations:

  • Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Bunkyo-ku, Tokyo 113-8656, Japan;Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Bunkyo-ku, Tokyo 113-8656, Japan

  • Venue:
  • Random Structures & Algorithms
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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 lnN) where n is the number of columns and N is the total sum of all entries. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006A preliminary version of this paper appeared in the Proceedings of the 3rd International Colloquium on Mathematics and Computer Science, Vienna, Austria, September 2004.