An analysis of a Monte Carlo algorithm for estimating the permanent
Karmarkar, Karp, Lipton, Lovász, and Luby proposed a Monte Carlo algorithm for approximating the permanent of a non-negativen×n matrix, which is based on an easily computed, unbiased estimator. It is not difficult to construct 0,1-matrices for which the variance of this estimator is very large, so that an exponential number of trials is necessary to obtain a reliable approximation that is within a constant factor of the correct value.
Nevertheless, the same authors conjectured that for a random 0,1-matrix the variance of the estimator is typically small. The conjecture is shown to be true; indeed, for almost every 0,1-matrixA, just O(nw(n)e-2) trials suffice to obtain a reliable approximation to the permanent ofA within a factor 1±ɛ of the correct value. Here ω(n) is any function tending to infinity asn→∞. This result extends to random 0,1-matrices with density at leastn−1/2ω(n).
It is also shown that polynomially many trials suffice to approximate the permanent of any dense 0,1-matrix, i.e., one in which every row- and column-sum is at least (1/2+α)n, for some constant α>0. The degree of the polynomial bounding the number of trials is a function of α, and increases as α→0.
Mathematics Subject Classification (1991)68 Q 25
Unable to display preview. Download preview PDF.
- Béla Bollobás:Random Graphs, Academic Press, 1985.Google Scholar
- Andrei Z. Broder: How hard is it to marry at random? (On the approximation of the permanent),Proceedings of the 18th ACM Symposium on Theory of Computing, 1986, 50–58. Erratum inProceedings of the 20th ACM Symposium on Theory of Computing, 1988, 551.Google Scholar
- Martin Dyer, Alan Frieze, andMark Jerrum: Approximately counting Hamilton cycles in dense graphs,Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 1994, 336–343.Google Scholar
- C. D. Godsil, andI. Gutman: On the matching polynomial of a graph,Algebraic Methods in Graph Theory, I (L. Lovász and V. T. Sós, editors), Colloquia Mathematica Societatis János Bolyai25, North-Holland, 1981.Google Scholar
- R. M. Karp, andM. Luby: Monte-Carlo algorithms for enumeration and reliability problems,Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, 1983, 56–64.Google Scholar
- László Lovász:Combinatorial Problems and Exercises, North-Holland, 1979.Google Scholar
- Henryk Minc:Permanents, Addison Wesley, 1978.Google Scholar