SearcharxivSearch

arXiv · 1704.08864

Models and algorithms for the next generation of glass transition studies

Abstract

Successful computer studies of glass-forming materials need to overcome both the natural tendency to structural ordering and the dramatic increase of relaxation times at low temperatures. We present a comprehensive analysis of eleven glass-forming models to demonstrate that both challenges can be efficiently tackled using carefully designed models of size polydisperse supercooled liquids together with an efficient Monte Carlo algorithm where translational particle displacements are complemented by swaps of particle pairs. We study a broad range of size polydispersities, using both discrete and continuous mixtures, and we systematically investigate the role of particle softness, attractivity and non-additivity of the interactions. Each system is characterized by its robustness against structural ordering and by the efficiency of the swap Monte Carlo algorithm. We show that the combined optimisation of the potential's softness, polydispersity and non-additivity leads to novel computer models with excellent glass-forming ability. For such models, we achieve over ten orders of magnitude gain in the equilibration timescale using the swap Monte Carlo algorithm, thus paving the way to computational studies of static and thermodynamic properties under experimental conditions. In addition, we provide microscopic insights into the performance of the swap algorithm which should help optimizing models and algorithms even further.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrea Ninarello, Ludovic Berthier, Daniele Coslovich. 2017-04-28. Models and algorithms for the next generation of glass transition studies. https://doi.org/10.1103/physrevx.7.021039

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

KEEP EXPLORING

Related papers

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

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

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