Problem hardness of diluted Ising models: Population Annealing versus Simulated Annealing

Fernando Martínez-García; Diego Porras

Home/Archive/arXiv

arXiv · 2501.07638

Problem hardness of diluted Ising models: Population Annealing versus Simulated Annealing

Fernando Martínez-García·Diego Porras

View original source ↗Read source document ↗Export metadata ↓

Abstract

Population annealing is a variant of the simulated annealing algorithm that improves the quality of the thermalization process in systems with rough free-energy landscapes by introducing a resampling process. We consider the diluted Sherrington-Kirkpatrick Ising model using population annealing to study its efficiency in finding solutions to combinatorial optimization problems. From this study, we find an easy-hard-easy transition in the model hardness as the problem instances become more diluted, and associate this behaviour to the clusterization and connectivity of the underlying Erd\H{o}s-R\'enyi graphs. We calculate the efficiency of obtaining minimum energy configurations and find that population annealing outperforms simulated annealing for the cases close to this hardness peak while reaching similar efficiencies in the easy limits. Finally, it is known that population annealing can be used to define an adaptive inverse temperature annealing schedule. We compare this adaptive method to a linear schedule and find that the adaptive method achieves improved efficiencies while being robust against final temperature miscalibrations.

Explore related subjects

cond-mat.stat-mech cond-mat.dis-nn

Keep this discovery

BibTeX RIS

Fernando Martínez-García, Diego Porras. 2025-01-13. Problem hardness of diluted Ising models: Population Annealing versus Simulated Annealing. https://arxiv.org/abs/2501.07638

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗

arXiv2026

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech↗

arXiv2026

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech↗