Polynomial time perfect sampling algorithm for two-rowed contingency tables

DOI10.1002/rsa.20087zbMath1104.62069OpenAlexW2057269834MaRDI QIDQ3419592

Shuji Kijima, Tomomi Matsui

Publication date: 7 February 2007

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20087

zbMATH Keywords

Markov chainsperfect sampling

Mathematics Subject Classification ID

Contingency tables (62H17) Complexity and performance of numerical algorithms (65Y20)

Related Items (6)

Polynomial time approximate or perfect samplers for discretized Dirichlet distribution ⋮ Perfect sampling on contingency tables with an application to SAGE data ⋮ Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers ⋮ Phase-II monitoring and diagnosing of multivariate categorical processes using generalized linear test-based control charts ⋮ Perfect simulation for models of industry dynamics ⋮ Random sampling of contingency tables via probabilistic divide-and-conquer

Cites Work

• Finite Markov Chains and Algorithmic Applications
• [https://portal.mardi4nfdi.de/wiki/Publication:4705324 Random generation of 2�n contingency tables]
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial time perfect sampling algorithm for two-rowed contingency tables