The Markov Chain Monte Carlo method: an approach to approximate counting and integration (1996)

by Mark Jerrum , Alistair Sinclair
Citations:235 - 12 self

Documents Related by Co-Citation

316 A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Non-Negative Entries – Mark Jerrum, Alistair Sinclair, Eric Vigoda - 2004
1876 Randomized Algorithms – Rajeev Motwani - 1995
58 Faster Random Generation of Linear Extensions – Russ Bubley, Martin Dyer - 1997
56 Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem – Jesús Salas, Alan D. Sokal - 1997
123 Monte-Carlo algorithms for enumeration and reliability problems – R M KARP, M LUBY - 1983
282 Vizirani: Random generation of combinatorial structures fro, a uniform distribution – M R Jerrum, L G Valiant, V V - 1986
178 Improved bounds for mixing rates of Markov chains and multicommodity flow – Alistair Sinclair - 1992
299 Approximating the permanent – Mark Jerrum, Alistair Sinclair - 1989
330 EIGENVALUES AND EXPANDERS – N. Alon - 1986
66 On Markov chains for independent sets – Martin Dyer, Catherine Greenhill - 1997
224 Random walks on finite groups and rapidly mixing Markov chains. Seminar on probability – D Aldous - 1983
511 The complexity of computing the permanent – L G Valiant - 1979
146 Path coupling: A technique for proving rapid mixing in markov chains – Russ Bubley, Martin Dyer, Leeds Ls Jt - 1997
110 A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structures and Algorithms 7 – M Jerrum - 1995
277 Geometric bounds for eigenvalues of Markov chains – Persi Diaconis, Daniel Stroock - 1991
116 A random polynomial-time algorithm for approximating the volume of convex bodies – Mary Cryan, Martin Dyer - 1991
2352 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
1477 Exactly Solved Models in Statistical Mechanics – R J Baxter - 1982
80 A Chernoff Bound For Random Walks On Expander Graphs – David Gillman - 1998