2 search results - page 1 / 1 » Rapidly Mixing Markov Chains for Sampling Contingency Tables... |
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...