Canonical Paths for MCMC: from Art to Science

Markov Chain Monte Carlo (MCMC) method is a widely used algorithm design scheme with many applications. To make efficient use of this method, the key step is to prove that the Markov chain is rapid mixing. Canonical paths is one of the two main tools to prove rapid mixing. However, there are much fewer success examples comparing to coupling, the other main tool. The main reason is that there is no systematic approach or general recipe to design canonical paths. Building up on a previous exploration by McQuillan [18], we develop a general theory to design canonical paths for MCMC: We reduce the task of designing canonical paths to solving a set of linear equations, which can be automatically done even by a machine. Making use of this general approach, we obtain fully polynomial-time randomized approximation schemes (FPRAS) for counting the number of b-matching with b ≤ 7 and b-edge-cover with b ≤ 2. They are natural generalizations of matchings and edge covers for graphs. No polynomial time approximation was previously known for these problems.

[1]  Eric Vigoda,et al.  Improved bounds for sampling colorings , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[2]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[3]  Colin McQuillan.  Approximating Holant problems by winding , 2013, ArXiv.

[4]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

[5]  Jackson B. Lackey,et al.  Errata: Handbook of mathematical functions with formulas, graphs, and mathematical tables (Superintendent of Documents, U. S. Government Printing Office, Washington, D. C., 1964) by Milton Abramowitz and Irene A. Stegun , 1977 .

[6]  Ivona Bezáková,et al.  Sampling Edge Covers in 3-Regular Graphs , 2009, MFCS.

[7]  Alistair Sinclair,et al.  Random walks on truncated cubes and sampling 0-1 knapsack solutions , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[8]  Martin E. Dyer,et al.  On Markov Chains for Independent Sets , 2000, J. Algorithms.

[9]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[10]  Martin E. Dyer,et al.  Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[11]  Leslie Ann Goldberg,et al.  A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid , 2010, SIAM J. Comput..

[12]  Martin E. Dyer,et al.  Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs , 2002, RANDOM.

[13]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[14]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[15]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[16]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[17]  Pinyan Lu,et al.  FPTAS for Counting Weighted Edge Covers , 2014, ESA.

[18]  Martin E. Dyer,et al.  Path coupling: A technique for proving rapid mixing in Markov chains , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[19]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[20]  Mark Jerrum,et al.  A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.

[21]  Pinyan Lu,et al.  A Simple FPTAS for Counting Edge Covers , 2013, SODA.