Skip to content
DraconiticResearch
Search Sources API
179,152 studies31 sourcesUpdated 54 min ago
PreprintarXiv licencearXiv

Single-Temperature Ranked Greedy Cluster Exchange for Max-Cut on Two-Dimensional Tori

Abstract

Ground-state search in two-dimensional Ising spin glasses on large toroidal lattices remains challenging for local-update heuristics because rugged energy barriers impede relaxation across metastable states. Equivalent to zero-field toroidal Max-Cut problems, these spin-glass instances also serve as standard benchmarks for optimization heuristics. Many Monte Carlo approaches combine single-spin flips or cluster moves with temperature ladders or annealing schedules, yet even with tuned parameters, rarely achieve rapid, reliable ground-state convergence at scale. Here, we address the need for faster ground-state search through cooperation between replicas. We introduce ranked greedy cluster exchange (RGCX) and combine it with fixed-temperature Metropolis sweeps to form single-temperature RGCX. Replicas are ranked by cut to determine the pair-processing order. Each pair deterministically exchanges every disagreement cluster that raises the better replica's cut, retaining the complement and conserving the pair's summed cut. On the 20,000-spin Gset instance G81, the estimated runtime to reach the certified optimum with 99% success probability (TTS99) was 12.1 s on an 8-core desktop computer. With the same population size, exchange interval and temperature, the method reached the best known cuts on all 17 toroidal Gset graphs, including 9 certified optima. These findings advance ground-state search on large two-dimensional tori by establishing single-temperature RGCX as an efficient population-based method that combines ranked greedy cluster exchange with fixed-temperature Metropolis dynamics.

Related

  1. Cluster-induced target shift and synthetic approximation for high-dimensional clustered data
    Shangyuan Ye, Cong Zhang, Ying Chen +2
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Exact Fragmentation and Terminal-Cluster Selection in One-Dimensional Finite-Range Normalized Alignment
    Jiangning Chen
    arXivPreprintarXiv licenceFull textDynamical systemsStatistical & nonlinear physicsarXiv
  3. Low-Temperature Large Deviations for the Two-Dimensional Wick-Ordered Cubic Wave Equation
    Daniel Heydecker
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsProbabilityarXiv
  4. Anchor-proofness in Voting with Ranked Ballots
    Federico Fioravanti, Zoi Terzopoulou
    HALPreprintCC BY 4.0Full textGeneral mathematicsHAL
  5. Spontaneous symmetry breaking at any temperature in a local one-dimensional model
    Andrew Lucas
    arXivPreprintarXiv licenceFull textMathematical physicsStatistical & nonlinear physicsarXiv
BibTeX
@misc{geng2026singletemperature,
  title = {{Single-Temperature Ranked Greedy Cluster Exchange for Max-Cut on Two-Dimensional Tori}},
  author = {Hao Geng and Nan Su and Gabriele Cavallaro},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.40515},
  eprint = {2610.40515},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.40515},
}
RIS
TY  - UNPB
TI  - Single-Temperature Ranked Greedy Cluster Exchange for Max-Cut on Two-Dimensional Tori
AU  - Hao Geng
AU  - Nan Su
AU  - Gabriele Cavallaro
PY  - 2026
DA  - 2026/10/29
PB  - arXiv
DO  - 10.48550/arxiv.2610.40515
UR  - https://arxiv.org/abs/2610.40515
AB  - Ground-state search in two-dimensional Ising spin glasses on large toroidal lattices remains challenging for local-update heuristics because rugged energy barriers impede relaxation across metastable states. Equivalent to zero-field toroidal Max-Cut problems, these spin-glass instances also serve as standard benchmarks for optimization heuristics. Many Monte Carlo approaches combine single-spin flips or cluster moves with temperature ladders or annealing schedules, yet even with tuned parameters, rarely achieve rapid, reliable ground-state convergence at scale. Here, we address the need for faster ground-state search through cooperation between replicas. We introduce ranked greedy cluster exchange (RGCX) and combine it with fixed-temperature Metropolis sweeps to form single-temperature RGCX. Replicas are ranked by cut to determine the pair-processing order. Each pair deterministically exchanges every disagreement cluster that raises the better replica's cut, retaining the complement and conserving the pair's summed cut. On the 20,000-spin Gset instance G81, the estimated runtime to reach the certified optimum with 99% success probability (TTS99) was 12.1 s on an 8-core desktop computer. With the same population size, exchange interval and temperature, the method reached the best known cuts on all 17 toroidal Gset graphs, including 9 certified optima. These findings advance ground-state search on large two-dimensional tori by establishing single-temperature RGCX as an efficient population-based method that combines ranked greedy cluster exchange with fixed-temperature Metropolis dynamics.
ER  -