Approximating the Permanent

A randomised approximation scheme for the permanent of a 0–1s presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter is accomplished by simulating a Markov chain whose states are the matchings in the graph. For a wide class of 0–1 matrices the approximation scheme is fully-polynomial, i.e., runs in time polynomial in the size of the matrix and a parameter that controls the accuracy of the output. This class includes all dense matrices (those that contain sufficiently many 1’s) and almost all sparse matrices in some reasonable probabilistic model for 0–1 matrices of given density.For the approach sketched above to be computationally efficient, the Markov chain must be rapidly mixing: informally, it must converge in a short time to its stationary distribution. A major portion of the paper is devoted to demonstrating that the matchings chain is rapidly mixing, apparently the first such result for a Markov chain with genuinely c...

[1]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[2]  J. Keilson.  Markov Chain Models--Rarity And Exponentiality , 1979 .

[3]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[4]  P. Diaconis,et al.  Generating a random permutation with random transpositions , 1981 .

[5]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[6]  Richard M. Karp,et al.  Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  Larry J. Stockmeyer,et al.  The complexity of approximate counting , 1983, STOC.

[8]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[9]  Béla Bollobás,et al.  Random Graphs , 1985 .

[10]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[11]  Andrei Z. Broder,et al.  How hard is it to marry at random? (On the approximation of the permanent) , 1986, STOC '86.

[12]  P. Diaconis,et al.  SHUFFLING CARDS AND STOPPING-TIMES , 1986 .

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

[14]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[15]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.

[16]  M. Jerrum.  Two-dimensional monomer-dimer systems are computationally intractable , 1987 .

[17]  D. Aldous.  On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing , 1987, Probability in the Engineering and Informational Sciences.

[18]  A. Sokal,et al.  Bounds on the ² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality , 1988 .

[19]  M. Luby,et al.  Polytopes, permanents and graphs with large factors , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[20]  A. Sinclair.  Randomised algorithms for counting and generating combinatorial structures , 1988 .

[21]  Bruce E. Hajek,et al.  The time complexity of maximum matching by simulated annealing , 1988, JACM.

[22]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[23]  Milena Mihail,et al.  On Coupling and the Approximation of the Permanent , 1989, Inf. Process. Lett..

[24]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.