Abstract

This paper outlines the use of rapidly mixing Markov Chains in randomized polynomial time algorithms to solve approximately certain counting prob-lems. They fall into two classes: combinatorial problems like counting the number of perfect matchings in certain graphs and geometric ones like computing the volumes of convex sets.

Citations

3012	Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images - Geman, Geman - 1984
969	Geometric Algorithms and Combinatorial Optimization - Grötschel, Lovász, et al. - 1993
409	The complexity of computing the permanent - Valiant - 1979
315	Sampling based approaches to calculating marginal densities - Gelfand, Smith - 1990
289	Eigenvalues and expanders - Alon - 1986
282	Matroid Theory - Welsh - 1976
257	Approximating the Permanent - Jerrum, Sinclair - 1989
253	A PolynomialTime Approximation Algorithm for the Permanent of a Matrix with Nonnegative Entries - Jerrum, Sinclair, et al.
250	Random Generation of Combinatorial Structures from a Uniform Distributions, Theoret. Computer Sci - Jerrum, Valiant, et al. - 1986
233	Geometric bounds for eigenvalues of Markov chains,” The Annals of Applied Probability - Diaconis, Stroock - 1991
222	An approximate max-flow mincut theorem for uniform multicommodity flow problems with applications to approximation algorithms - Leighton, Rao - 1988
222	Non-Negative Matrices and Markov Chains - Seneta - 1981
216	Approximate counting, uniform generation and rapidly mixing Markov chains - Sinclair, Jerrum - 1989
203	Nonuniversal critical dynamics in Monte Carlo simulations - Swendsen, Wang - 1987
200	Random walk on finite groups and rapidly mixing Markov chains - Aldous - 1983
159	lower bound for the smallest eigenvalue of the Laplacian - Cheeger, “A - 1970
158	Improved bounds for mixing rates of Markov chains and multicommodity flow - Sinclair - 1992
153	Algebraic algorithms for sampling from conditional distributions - Diaconis, Sturmfels - 1998
148	Random walks, universal traversal sequences, and the complexity of maze problems - Aleliunas, Karp, et al. - 1979
130	A random polynomial time algorithm for approximating the volume of a convex body - Dyer, Frieze, et al. - 1991
109	Monte-Carlo algorithms for enumeration and reliability problems - KARP, LUBY - 1983
99	Generating random spanning trees - Broder - 1989
97	Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed - Barvinok - 1994
92	Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. The Annals of Applied Probablity - Fill - 1991
79	Shuffling cards and stopping times - Aldous, Diaconis - 1986
73	Balanced Matroids - Feder, Mihail - 1992
71	On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing - Aldous - 1987
69	Sampling and Integration of Near Log-Concave functions, STOC - Applegate, Kannan - 1991
66	A Chernoff bound for random walks on expander graphs - Gillman - 1998
62	How hard is to marry at random? (On the approximation of the permanent - Broder - 1986
58	Frieze A: On the complexity of computing the volume of a polyhedron - Dyer - 1988
52	Computing the volume of convex bodies: A case where randomness provably helps - Dyer, Frieze - 1991
50	Some inequalities for reversible Markov chains - Aldous - 1982
39	Counting linear extensions is #P-complete - Birghtwell, Winkler - 1991
31	A geometric inequality and the complexity of computing volume - Elekes - 1986
31	Sampling from log-concave distributions - Frieze, Kannan, et al. - 1994
29	Fast uniform generation of regular graphs - Jerrum, Sinclair - 1990
29	On the conductance of order Markov chains - Karzanov, Khachiyan - 1991
28	A mildly exponential approximation algorithm for the permanent, Algorithmica 16 - Jerrum, Vazirani - 1996
21	A Monte-Carlo algorithm for estimating the permanent - Karmarkar, Karp, et al. - 1993
20	A mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem - Dyer, Frieze, et al. - 1993
19	A Polynomial Time Algorithm for Linear Programming - Khachiyan - 1979
18	Bounds on the L2 spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality - Lawler, Sokal - 1988
14	Random walks, totally unimodular matrices, and a randomised dual simplex algorithm - Dyer, Frieze - 1994
13	Random Polynomial time algorithms for sampling from joint distributions - Kannan, R, et al. - 1990
12	A randomised approximation algorithm for counting the number of forests - Annan - 1994
12	The number of solutions to linear Diophantine equations and multivariate splines - Micchelli - 1988
11	Jerrum M.R., Approximately counting Hamilton cycles in dense graphs - Dyer, Frieze - 1994
10	The random walk construction for spanning trees and uniform labeled trees - Aldous - 1990
10	Efficient Monte-Carlo procedures for generating points uniformly distributed over bounded regions, Operations Res - Smith - 1984