Heuristic Monte Carlo Method Applied to Cooperative Motion Algorithm for Binary Lattice Fluid

Piotr Knychala; Michal Banaszak

Home/Archive/arXiv

arXiv · 1410.3015

Heuristic Monte Carlo Method Applied to Cooperative Motion Algorithm for Binary Lattice Fluid

Piotr Knychala·Michal Banaszak

View original source ↗Read source document ↗Export metadata ↓

Abstract

The Cooperative Motion Algorithm is an efficient lattice method to simulate dense polymer systems and is often used with two different criteria to generate a Markov chain in the configuration space. While the first method is the well-established Metropolis algorithm, the other one is an heuristic algorithm which needs justification. As an introductory step towards justification for the 3D lattice polymers, we study a simple system which is the binary equimolar uid on a 2D triangular lattice. Since all lattice sites are occupied only selected type of motions are considered, such the vacancy movements, swapping neighboring lattice sites (Kawasaki dynamics) and cooperative loops. We compare both methods, calculating the energy as well as heat capacity as a function of temperature. The critical temperature, which was determined using the Binder cumulant, was the same for all methods with the simulation accuracy and in agreement with the exact critical temperature for the Ising model on the 2D triangular lattice. In order to achieve reliable results at low temperatures we employ the parallel tempering algorithm which enables simultaneous simulations of replicas of the system in a wide range of temperatures.

Explore related subjects

cond-mat.stat-mech cs.CE

Keep this discovery

BibTeX RIS

Piotr Knychala, Michal Banaszak. 2014-10-11. Heuristic Monte Carlo Method Applied to Cooperative Motion Algorithm for Binary Lattice Fluid. https://arxiv.org/abs/1410.3015

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↗