On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
Computing and Combinatorics, pp. 457-468, 2011.
Abstract The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but e‐cient solutions are only known in special cases. One appealing approach is the Diaconis and Gangolli Markov chain which updates the entries of a random 2£2 submatrix. This chain is known to be rapidly mixing for cell-b...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)