Entropic algorithms and the lid method as exploration tools for complex landscapes

Daniele Barettin; Paolo Sibani

doi:10.1103/physreve.84.036706

Home/Archive/arXiv

arXiv · 1104.1780

Entropic algorithms and the lid method as exploration tools for complex landscapes

Daniele Barettin·Paolo Sibani

View original source ↗Read source document ↗Export metadata ↓

Abstract

Monte Carlo algorithms such as the Wang-Landau algorithm and similar `entropic' methods are able to accurately sample the density of states of model systems and thereby give access to thermal equilibrium properties at any temperature. Thermal equilibrium is however not achievable at low temperatures in glassy systems. Such systems are characterized by a multitude of metastable configurations, pictorially referred to as `valleys' of an energy landscape. Geometrical properties of the landscape, e.g. the local density of states describing the distribution in energy of the states belonging to a single valley, are key to understand the dynamical properties of such systems. In this paper we combine the lid algorithm, a tool for landscape exploration previously applied to a range of models, with the Wang-Swendsen algorithm. To test this improved exploration tool, we consider a paradigmatic complex system, the Edwards-Andersom model in two and three spatial dimension. We find a striking difference between the energy dependence of the local density of states in the two cases: nearly flat in the first case, and nearly exponential in the second. The lid dependence of the data is analyzed to estimate the form of the global density of states.

Explore related subjects

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

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Daniele Barettin, Paolo Sibani. 2011-07-17. Entropic algorithms and the lid method as exploration tools for complex landscapes. https://doi.org/10.1103/physreve.84.036706

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↗