Abstract
This paper proposesapolynomialtime perfect (exact)sampling algorithm for2 xn contingencytables.Our algorithm isa LasVegas type randomized algorithm and the expected running time is boundedby 0(n3InN) where n isthenumber of columnsandN is the total sum of whole entries ina table.The algorithm is based on monotone coupling from thepast(monotone CFTP) algorithm and new Markov chain for sampling two-rowed contingency tables uniformly. We employed thepathcoupling methodandshowed the mixing rate of our chain. Our result indicatesthatuniform generation of two-rowed contingency tables is easier than the corresponding counting problem,since the counting problem is known to be #P-complete.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
