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

by Mark Jerrum , Alistair Sinclair
Citations:234 - 13 self

Active Bibliography

48 Markov Chains and Polynomial time Algorithms – Ravi Kannan - 1994
ICM 2002 · Vol. III · 1–3 Rapid Mixing in Markov Chains – R. Kannan, R. Kannan - 2003
30 Mathematical foundations of the Markov chain Monte Carlo method – Mark Jerrum - 1998
2 Counting in Lattices: Combinatorial Problems from Statistical Mechanics – Dana Randall - 1994
324 A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Non-Negative Entries – Mark Jerrum, Alistair Sinclair, Eric Vigoda - 2004
16 Rapidly Mixing Markov Chains: A Comparison of Techniques – Venkatesan Guruswami - 2000
4 Convergence Rates For Monte Carlo Experiments – Alistair Sinclair - 1997
2 Convergence Of Markov Chain Monte Carlo Algorithms With Applications To Image Restoration – Alison L. Gibbs - 2000
MIXING – Dana Randall
7 Computational Pólya theory – Mark Jerrum - 1995
64 Analyzing Glauber Dynamics by Comparison of Markov Chains – Dana Randall, Prasad Tetali - 1999
248 Random Walks on Graphs: A Survey – L. Lovász - 1993
186 Improved bounds for mixing rates of Markov chains and multicommodity flow – Alistair Sinclair - 1992
Conductance and Rapidly Mixing Markov Chains – Jamie King - 2003
42 Eigenvalues in combinatorial optimization – Bojan Mohar, Svatopluk Poljak - 1993
THE UNIVERSITY OF CHICAGO FASTER MARKOV CHAIN MONTE CARLO ALGORITHMS FOR THE PERMANENT AND BINARY CONTINGENCY TABLES A DISSERTATION SUBMITTED TO THE FACULTY OF THE DIVISION OF THE PHYSICAL SCIENCES IN CANDIDACY FOR THE DEGREE OF – unknown authors
71 The Complexity of Counting in Sparse, Regular, and Planar Graphs – Salil P. Vadhan - 1997
34 Graph embeddings and Laplacian eigenvalues – Stephen Guattery, Gary L. Miller - 2000
5 Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger? – Jason Fulman, Elizabeth L. Wilmer - 1999