Search arXivSearch

arXiv · 2403.09786

Phase determination with and without deep learning

Abstract

Detection of phase transitions is a critical task in statistical physics, traditionally pursued through analytic methods and direct numerical simulations. Recently, machine-learning techniques have emerged as promising tools in this context, with a particular focus on supervised and unsupervised learning methods, along with non-learning approaches. In this work, we study the performance of unsupervised learning in detecting phase transitions in the $J_1$-$J_2$ Ising model on the square lattice. The model is chosen due to its simplicity and complexity, thus providing an understanding of the application of machine-learning techniques in both straightforward and challenging scenarios. We propose a simple method based on a direct comparison of configurations. The reconstruction error, defined as the mean-squared distance between two configurations, is used to determine the critical temperatures ($T_c$). The results from the comparison of configurations are contrasted with that of the configurations generated by variational autoencoders. Our findings highlight that for certain systems, a simpler method can yield results comparable to more complex neural networks. This work contributes to the broader understanding of machine-learning applications in statistical physics and introduces an efficient approach to the detection of phase transitions using machine determination techniques.

Explore related subjects

Keep this discovery

BibTeXRIS

Burak Çivitcioğlu, Rudolf A. Römer, Andreas Honecker. 2024-03-14. Phase determination with and without deep learning. https://doi.org/10.1103/physreve.111.024131

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