The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Optimization with Extremal Dynamics
Open accessAbstract
We explore a new general-purpose heuristic for finding high-quality solutions to hard discrete optimization problems. The method, called extremal optimization, is inspired by self-organized criticality, a concept introduced to describe emergent complexity in physical systems. Extremal optimization successively updates extremely undesirable variables of a single suboptimal solution, assigning them new, random values. Large fluctuations ensue, efficiently exploring many local optima. We use extremal optimization to elucidate the phase transition in the 3-coloring problem, and we provide independent confirmation of previously reported extrapolations for the ground-state energy of +/-J spin glasses in d = 3 and 4.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
(1979) · Cited by 43,841
Self-organized criticality: An explanation of the 1/f noise
Bak, P., Tang, C., & Wiesenfeld, K. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.381 · Cited by 7,591
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
Bak, P. (1996) · Springer eBooks · doi:10.1007/978-1-4757-5426-1 · Cited by 2,809
Punctuated equilibrium and criticality in a simple model of evolution
Bak, P., & Sneppen, K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.4083 · Cited by 1,497
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
Where the really hard problems are
Cheeseman, P. C., Kanefsky, B., & Taylor, W. M. (1991) · Cited by 1,004
Determining computational complexity from characteristic ‘phase transitions’
Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., & Troyansky, L. (1999) · Nature · doi:10.1038/22055 · Cited by 790
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“Better results can be obtained if one introduces a probabilistic selection, in which vertices are ranked based on their fitness values and one picks the vertex of rank qwith the probability P(q) ∼ q (τ -EO, [196]).”
BackgroundMethodInfluentialComparing community structure identification
Danon, L., Díaz-Guilera, A., Duch, J., & Arenas, A. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09008 · Cited by 2,872
Community detection in complex networks using extremal optimization
Duch, J., & Arenas, A. (2005) · Physical Review E · doi:10.1103/physreve.72.027104 · Cited by 1,549
Influence maximization in complex networks through optimal percolation
Morone, F., & Makse, H. A. (2015) · Nature · doi:10.1038/nature14604 · Cited by 1,230
Vital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
Community detection in networks: A multidisciplinary review
Javed, M. A., Younis, M. S., Latif, S., Qadir, J., & Baig, A. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.02.011 · Cited by 499
Chen, J., Zeng, G.-Q., Zhou, W., Du, W., & Lu, K.-D. (2018) · Energy Conversion and Management · doi:10.1016/j.enconman.2018.03.098 · Cited by 419
A Survey on ensemble learning under the era of deep learning
Yang, Y., Lv, H., & Chen, N. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10283-5 · Cited by 369
A classification for community discovery methods in complex networks
Coscia, M., Giannotti, F., & Pedreschi, D. (2011) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.10133 · Cited by 353
Community Detection via Maximization of Modularity and Its Variants
Chen, M., Kuzmin, K., & Szymanski, B. K. (2014) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2014.2307458 · Cited by 301
Akbari, M. A., Zare, M., Azizipanah-abarghooee, R., Mirjalili, S., & Deriche, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-14338-z · Cited by 282
Zeng, G.-Q., Chen, J., Dai, Y.-X., Li, L.-M., Zheng, C.-W., & Chen, M.-R. (2015) · Neurocomputing · doi:10.1016/j.neucom.2015.02.051 · Cited by 281
Detecting multiple communities using quantum annealing on the D-Wave system
Negre, C. F. A., Ushijima-Mwesigwa, H., & Mniszewski, S. M. (2020) · PLOS ONE · doi:10.1371/journal.pone.0227538 · Cited by 80
“Several algorithms have been proposed based on greedy techniques [13, 14], simulated annealing [15, 16], genetic algorithm[17], spectral optimization [18] and extreme optimization methods [19, 20].”
MethodOptimization by Self-Organized Criticality
Hoffmann, H., & Payton, D. W. (2018) · Scientific Reports · doi:10.1038/s41598-018-20275-7 · Cited by 65
Metadata
- Authors
- Boettcher, S., & Percus, A. G.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2001-06-04
- Volume
- 86
- Issue
- 23
- Pages
- 5211-5214
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2963332217
- Cited by
- 342
- References
- 22
- FWCI
- 7.98
- Type
- journal article
- Language
- en
- Open access
- green
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.