The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Approximating the Permanent
Abstract
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 complex structure. The techniques used seem to have general applicability, and are applied again in the paper to validate a fully-polynomial randomised approximation scheme for the partition function of an arbitrary monomer-dimer system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Bollobás, B. (1985) · Cited by 6,196
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
The Complexity of Enumeration and Reliability Problems
Valiant, L. G. (1979) · SIAM Journal on Computing · doi:10.1137/0208032 · Cited by 2,076
Cooling Schedules for Optimal Annealing
Hajek, B. (1988) · Mathematics of Operations Research · doi:10.1287/moor.13.2.311 · Cited by 1,246
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Random generation of combinatorial structures from a uniform distribution
Jerrum, M. R., Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90174-x · Cited by 985
Self-citationλ1, Isoperimetric inequalities for graphs, and superconcentrators
Alon, N., & Milman, V. D. (1985) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(85)90092-9 · Cited by 839
Markov Chain Models — Rarity and Exponentiality
(1979) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-6200-8 · Cited by 826
Cited by
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
The Cross-Entropy Method for Combinatorial and Continuous Optimization
Rubinstein, R. (1999) · Methodology And Computing In Applied Probability · doi:10.1023/a:1010091220143 · Cited by 903
Latent semantic indexing: a probabilistic analysis
Papadimitriou, C. H., Tamaki, H., Raghavan, P., & Vempala, S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275505 · Cited by 863
Simulated annealing: A tool for operational research
Eglese, R. W. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90001-r · Cited by 801
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Jerrum, M., Sinclair, A., & Vigoda, E. (2004) · Journal of the ACM · doi:10.1145/1008731.1008738 · Cited by 792
Self-citationFastest Mixing Markov Chain on a Graph
Boyd, S., Diaconis, P., & Xiao, L. (2004) · SIAM Review · doi:10.1137/s0036144503423264 · Cited by 744
Nisan, N., & Zuckerman, D. (1996) · Journal of Computer and System Sciences · doi:10.1006/jcss.1996.0004 · Cited by 634
A survey of simulated annealing as a tool for single and multiobjective optimization
Suman, B., & Kumar, P. (2006) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2602068 · Cited by 611
Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., & Watrous, J. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380757 · Cited by 562
Latent Semantic Indexing: A Probabilistic Analysis
Papadimitriou, C. H., Raghavan, P., Tamaki, H., & Vempala, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1711 · Cited by 556
Polynomial-Time Approximation Algorithms for the Ising Model
Jerrum, M., & Sinclair, A. (1993) · SIAM Journal on Computing · doi:10.1137/0222066 · Cited by 548
Self-citationQuick Approximation to Matrices and Applications
Frieze, A., & Kannan, R. (1999) · Combinatorica · doi:10.1007/s004930050052 · Cited by 502
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
Sinclair, A. (1992) · Combinatorics, Probability and Computing · doi:10.1017/s0963548300000390 · Cited by 498
Self-citationGenerating random spanning trees more quickly than the cover time
Wilson, D. B. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237880 · Cited by 487
Some applications of Laplace eigenvalues of graphs
Mohar, B. (1997) · Graph Symmetry · doi:10.1007/978-94-015-8937-6_6 · Cited by 422
Expander flows, geometric embeddings and graph partitioning
Arora, S., Rao, S., & Vazirani, U. (2009) · Journal of the ACM · doi:10.1145/1502793.1502794 · Cited by 418
The electrical resistance of a graph captures its commute and cover times
Chandra, A. K., Raghavan, P., Ruzzo, W. L., & Smolensky, R. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73062 · Cited by 360
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Quantum speedup of Monte Carlo methods
Montanaro, A. (2015) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2015.0301 · Cited by 334
The electrical resistance of a graph captures its commute and cover times
Chandra, A. K., Raghavan, P., Ruzzo, W. L., Smolensky, R., & Tiwari, P. (1996) · Computational Complexity · doi:10.1007/bf01270385 · Cited by 328
A proof of Alon’s second eigenvalue conjecture and related problems
Friedman, J. (2008) · Memoirs of the American Mathematical Society · doi:10.1090/memo/0910 · Cited by 328
Large Cliques Elude the Metropolis Process
Jerrum, M. (1992) · Random Structures & Algorithms · doi:10.1002/rsa.3240030402 · Cited by 312
Self-citationExpander flows, geometric embeddings and graph partitioning
Arora, S., Rao, S., & Vazirani, U. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007355 · Cited by 297
Metadata
- Authors
- Jerrum, M., & Sinclair, A.
- Venue
- SIAM Journal on Computing
- Published
- 1989-12
- Volume
- 18
- Issue
- 6
- Pages
- 1149-1178
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2106285343
- Cited by
- 768
- References
- 26
- FWCI
- 9.44
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.