Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2305.19994

Resampling schemes in population annealing: Numerical and theoretical results

Denis Gessert·Wolfhard Janke·Martin Weigel
View original source ↗Read source document ↗Export metadata ↓

Abstract

The population annealing algorithm is a population-based equilibrium version of simulated annealing. It can sample thermodynamic systems with rough free-energy landscapes more efficiently than standard Markov chain Monte Carlo alone. A number of parameters can be fine-tuned to improve the performance of the population annealing algorithm. While there is some numerical and theoretical work on most of these parameters, there appears to be a gap in the literature concerning the role of resampling in population annealing which this work attempts to close. The two-dimensional Ising model is used as a benchmarking system for this study. At first various resampling methods are implemented and numerically compared. In a second part the exact solution of the Ising model is utilized to create an artificial population annealing setting with effectively infinite Monte Carlo updates at each temperature. This limit is first performed on finite population sizes and subsequently extended to infinite populations. This allows us to look at resampling isolated from other parameters. Many results are expected to generalize to other systems.

Explore related subjects

cond-mat.stat-mechphysics.comp-ph

Keep this discovery

BibTeXRIS

Denis Gessert, Wolfhard Janke, Martin Weigel. 2023-05-31. Resampling schemes in population annealing: Numerical and theoretical results. https://arxiv.org/abs/2305.19994

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↗