The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Large Cliques Elude the Metropolis Process
Abstract
In a random graph on n vertices, the maximum clique is likely to be of size very close to 2 lg n. However, the clique produced by applying the naive “greedy” heuristic to a random graph is unlikely to have size much exceeding lg n. The factor of two separating these estimates motivates the search for more effective heuristics. This article analyzes a heuristic search strategy, the Metropolis process, which is just one step above the greedy one in its level of sophistication. It is shown that the Metropolis process takes super‐polynomial time to locate a clique that is only slightly bigger than that produced by the greedy heuristic.
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
Jerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 768
Self-citationA random polynomial-time algorithm for approximating the volume of convex bodies
Dyer, M., Frieze, A., & Kannan, R. (1991) · Journal of the ACM · doi:10.1145/102782.102783 · Cited by 693
Algorithms and Complexity: New Directions and Recent Results
Traub, J. F. (1976) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 427
Grimmett, G. R., & McDiarmid, C. J. H. (1975) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100051124 · Cited by 333
Graph bisection algorithms with good average case behavior
Bui, T. N., Chaudhuri, S., Leighton, F. T., & Sipser, M. (1987) · Combinatorica · doi:10.1007/bf02579448 · Cited by 323
Bollobas, B., & Erdös, P. (1976) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100053056 · Cited by 321
The solution of some random NP-hard problems in polynomial expected time
Dyer, M., & FRIEZE, A. M. (1989) · Journal of Algorithms · doi:10.1016/0196-6774(89)90001-1 · Cited by 189
A random polynomial time algorithm for approximating the volume of convex bodies
Dyer, M., & FRIEZE, A. M. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73043 · Cited by 124
Expanding graphs and the average-case analysis of algorithms for matchings and related problems
Motwani, R. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73060 · Cited by 15
Cited by
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
Statistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
A Column Generation Approach for Graph Coloring
Mehrotra, A., & Trick, M. A. (1996) · INFORMS Journal on Computing · doi:10.1287/ijoc.8.4.344 · Cited by 410
Metadata
- Authors
- Jerrum, M.
- Venue
- Random Structures & Algorithms
- Publisher
- Wiley
- Published
- 1992-01
- Volume
- 3
- Issue
- 4
- Pages
- 347-359
- ISSN
- 1042-9832 (ISSN-L)
- 1098-2418
- OpenAlex
- W2010601719
- Cited by
- 312
- References
- 10
- FWCI
- 7.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Large Cliques Elude the Metropolis Process. https://app.cochat.ai/papers/10.1002/rsa.3240030402
- The paper
- Jerrum, M. (1992). Large Cliques Elude the Metropolis Process. Random Structures & Algorithms. https://doi.org/10.1002/rsa.3240030402
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.