Search arXiv⌕ Search

arXiv · physics/0703225

Entropic effects in large-scale Monte Carlo simulations

Abstract

The efficiency of Monte Carlo samplers is dictated not only by energetic effects, such as large barriers, but also by entropic effects that are due to the sheer volume that is sampled. The latter effects appear in the form of an entropic mismatch or divergence between the direct and reverse trial moves. We provide lower and upper bounds for the average acceptance probability in terms of the Renyi divergence of order 1/2. We show that the asymptotic finitude of the entropic divergence is the necessary and sufficient condition for non-vanishing acceptance probabilities in the limit of large dimensions. Furthermore, we demonstrate that the upper bound is reasonably tight by showing that the exponent is asymptotically exact for systems made up of a large number of independent and identically distributed subsystems. For the last statement, we provide an alternative proof that relies on the reformulation of the acceptance probability as a large deviation problem. The reformulation also leads to a class of low-variance estimators for strongly asymmetric distributions. We show that the entropy divergence causes a decay in the average displacements with the number of dimensions n that are simultaneously updated. For systems that have a well-defined thermodynamic limit, the decay is demonstrated to be n^{-1/2} for random-walk Monte Carlo and n^{-1/6} for Smart Monte Carlo (SMC). Numerical simulations of the LJ_38 cluster show that SMC is virtually as efficient as the Markov chain implementation of the Gibbs sampler, which is normally utilized for Lennard-Jones clusters. An application of the entropic inequalities to the parallel tempering method demonstrates that the number of replicas increases as the square root of the heat capacity of the system.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristian Predescu. 2007-06-27. Entropic effects in large-scale Monte Carlo simulations. https://doi.org/10.1103/physreve.76.016704

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

KEEP EXPLORING

Related papers

Universal Hamiltonian learning with rotational and basis equivariance

Deep learning has the potential to transform computational materials research by making electronic-structure calculations more efficient and scalable. The Hamiltonian matrix in the localized atomic-orbital basis is a promising target for deep-learning electronic structure, yet enforcing rotational equivariance can be computationally costly, and the matrix depends on the choice of basis set. Here we introduce DeepH-2, a physics-guided neural-network framework that reduces the computational cost of enforcing rotational equivariance through a local-coordinate formulation and incorporates basis equivariance by mapping a shared latent Hamiltonian to the target atomic-orbital basis. DeepH-2 achieves sub-meV test-set error on a diverse materials dataset and demonstrates transferability across material dimensions. These results highlight the value of encoding physics priors into deep-learning electronic structure models, and pave the way for developing the electronic-structure foundation models.

physics.comp-ph↗

Complex Hyperspin Machine and Symmetry Quenching: Benchmark and scaling up to millions of degrees of freedom

Driven-dissipative oscillator networks have been proposed to simulate spin models on physical hardware, mostly focusing on systems of binary (Ising) spins, or systems of spin vectors in low dimensions. The equalized hyperspin machine was recently introduced to provide a single platform to simulate general models of $N$ coupled spin vectors with tunable dimension $D$, realizing dynamical annealing protocols to vary the spin dimensionality in time. These schemes are limited to real spins coupled via real coupling matrices. We propose a generalization of the hyperspin machine that works with complex fields and deals with complex Hermitian coupling matrices, implementing an amplitude equalization scheme. This system, which we name complex hyperspin machine, can work on optimization problems with complex valued hyperspins that can be cast on complex $D$-vector Hamiltonians. We benchmark the machine against a differential evolution (DE) algorithm on complex $D=2$ hyperspins up to $N=80$, showing that the fraction of instances where a lower-energy solution is found grows with system size and coupling density, reaching $92.5\%$ at the largest considered sizes. When the DE finds a lower-energy solution, the machine still reaches a median relative energy deviation that lies between $10^{-15}$ and $10^{-12}$ while running at substantially lower computational cost. Using the complex nature of the field, we introduce a new dimensional reduction protocol that we name symmetry quenching, which collapses complex variables that map to XY spins onto real Ising spins by switching on the parametric pump. We show on Max-Cut instances with known ground states that symmetry quenching outperforms a fixed-pump Ising machine, reaching exact ground states in the presence of equalization. We scale the system to $N=10^6$ hyperspins, or $8\times10^6$ dynamical variables, on a Hermitian sparse two-dimensional lattice.

physics.comp-ph↗

Learning Stiff Dynamical Operators: Scaling, Fast-Slow Excitation, and Eigen-Consistent Neural Models

Stiff dynamical systems represent a central challenge in multi scale modeling across combustion, chemical kinetics, and nonlinear dynamical systems. Neural operator learning has recently emerged as a promising approach to approximate dynamical generators from data, yet stiffness imposes severe obstacles: training errors concentrate on slow manifold states, collapse of fast dynamics occurs, and the learned operator may fail to reproduce the true eigenstructure. We demonstrate three key advances enabling accurate learning of stiff operators and preserving spectral fidelity: (i) stiffness aware scaling of time derivatives, (ii) fast direction excitation via local trajectory cloud bursts, and (iii) autograd-based Jacobian diagnostics ensuring eigenstructure fidelity. Applied to the Davis-Skodje system, the approach recovers both slow and fast modes across stiffness regimes, reducing fast eigenvalue error by an order of magnitude while improving rollout fidelity. These results argue that spectral fidelity - not trajectory accuracy alone - should be a first-class target in data driven learning of stiff operators.

physics.comp-ph↗