On sampling with Markov chains

DOI<55::AID-RSA4>3.0.CO;2-A 10.1002/(SICI)1098-2418(199608/09)9:1/2<55::AID-RSA4>3.0.CO;2-AzbMath0861.60079OpenAlexW2039689894WikidataQ34674185 ScholiaQ34674185MaRDI QIDQ4894601

Fan R. K. Chung, Ronald L. Graham, Shing Tung Yau

Publication date: 22 April 1997

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<55::aid-rsa4>3.0.co;2-a

zbMATH Keywords

random walksrapid convergencecontingency tableseigenvalue boundsknapsack solutions

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Eigenvalue problems for linear operators (47A75) Contingency tables (62H17)

Related Items

Analysis of a nonreversible Markov chain sampler., A note on Neumann problems on graphs, Coupling, spectral gap and related topics. II, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), Neumann Cheeger constants on graphs, Sampling contingency tables, Unnamed Item, Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables, A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant, Algebraic algorithms for sampling from conditional distributions, Ricci curvature of graphs, Polynomial-time counting and sampling of two-rowed contingency tables