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
Approximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
Self-citationConvergence of an annealing algorithm
Lundy, M., & Mees, A. (1986) · Mathematical Programming · doi:10.1007/bf01582166 · Cited by 693
Graph theory and theoretical physics
Harary, F. (1967) · Cited by 630
Probabilistic Methods in Combinatorics
Spencer, J. (1995) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9078-6_132 · Cited by 588
Generating a random permutation with random transpositions
Diaconis, P., & Shahshahani, M. (1981) · Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete · doi:10.1007/bf00535487 · Cited by 575
Shuffling Cards and Stopping Times
Aldous, D., & Diaconis, P. (1986) · The American Mathematical Monthly · doi:10.1080/00029890.1986.11971821 · Cited by 475
Random walks on finite groups and rapidly mixing markov chains
Aldous, D. (1983) · Lecture notes in mathematics · doi:10.1007/bfb0068322 · Cited by 450
Monte-Carlo algorithms for enumeration and reliability problems
Karp, R. M., & Luby, M. G. (1983) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1983.35 · Cited by 320
Lawler, G. F., & Sokal, A. D. (1988) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1988-0930082-9 · Cited by 265
The complexity of approximate counting
Stockmeyer, L. (1983) · Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 · doi:10.1145/800061.808740 · Cited by 196
How hard is it to marry at random? (On the approximation of the permanent)
Broder, A. Z. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12136 · Cited by 173
Aldous, D. (1987) · Probability in the Engineering and Informational Sciences · doi:10.1017/s0269964800000267 · Cited by 133
Two-dimensional monomer-dimer systems are computationally intractable
Jerrum, M. (1987) · Journal of Statistical Physics · doi:10.1007/bf01010403 · Cited by 124
Self-citationTwo-dimensional monomer-dimer systems are computationally intractable
Jerrum, M. (1990) · Journal of Statistical Physics · doi:10.1007/bf01025864 · Cited by 116
Self-citationA Monte-Carlo Algorithm for Estimating the Permanent
Karmarkar, N. K., Karp, R. M., Lipton, R., Lovász, L., & Luby, M. G. (1993) · SIAM Journal on Computing · doi:10.1137/0222021 · Cited by 115
Polytopes, permanents and graphs with large factors
Dagum, P., Luby, M. G., Mihail, M., & Vazirani, U. V. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21957 · Cited by 67
Cited by
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
Fastest Mixing Markov Chain on a Graph
Boyd, S., Diaconis, P., & Xiao, L. (2004) · SIAM Review · doi:10.1137/s0036144503423264 · Cited by 744
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.