Related papers: Cluster Dynamics Stay Fast-Until Tricriticality
Dynamic phase transition phenomena in ultrathin films described by Blume-Capel model have been investigated using Monte Carlo simulations. Hysteresis loops, micromagnetic structures, and hysteresis loop area curves, as well as dynamic…
Proposed here is a dynamic Monte-Carlo algorithm that is efficient in simulating dense systems of long flexible chain molecules. It expands on the configurational-bias Monte-Carlo method through the simultaneous generation of a large set of…
Using the concept of finite-size scaling, Monte Carlo calculations of various models have become a very useful tool for the study of critical phenomena, with the system linear dimension as a variable. As an example, several recent studies…
We discuss the analytic computation of autocorrelation functions for the generalized Hybrid Monte Carlo algorithm applied to free field theory and compare the results with numerical results for the $O(4)$ spin model in two dimensions. We…
Global optimization is an active area of research in atomistic simulations, and many algorithms have been proposed to date. A prominent example is basin hopping Monte Carlo, which performs a modified Metropolis Monte Carlo search to explore…
Stochastic sampling algorithms such as Langevin Monte Carlo are inspired by physical systems in a heat bath. Their equilibrium distribution is the canonical ensemble given by a prescribed target distribution, so they must balance…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
Metropolis Monte Carlo simulation is a powerful tool for studying the equilibrium properties of matter. In complex condensed-phase systems, however, it is difficult to design Monte Carlo moves with high acceptance probabilities that also…
The theoretical justification of the Hybrid Monte Carlo algorithm depends upon the molecular dynamics trajectories within it being exactly reversible. If computations were carried out with exact arithmetic then it would be easy to ensure…
Finite-dimensional signatures of spinodal criticality are notoriously difficult to come by. The dynamical transition of glass-forming liquids, first described by mode-coupling theory, is a spinodal instability preempted by thermally…
We use a standard Monte-Carlo algorithm to study the slow dynamics of a binary Lennard-Jones glass-forming mixture at low temperature. We find that Monte-Carlo is by far the most efficient way to simulate a stochastic dynamics since…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
Model predictive control (MPC) of hybrid dynamical systems is challenging because the associated optimization problem is nonsmooth and the resulting feedback law is discontinuous. This paper develops real-time MPC algorithms for nonlinear…
Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost. Using a combination of analytical and numerical approaches, we study their convergence properties towards the steady state, within a random walk Metropolis…
Event-chain Monte Carlo (ECMC) accelerates the sampling of hard-sphere systems, and has been generalized to the potentials used in classical molecular simulation. Rather than imposing detailed balance on transition probabilities, the method…
We apply a new updating algorithm scheme to investigate the critical behavior of the two-dimensional ferromagnetic Ising model on a triangular lattice with nearest neighbour interactions. The transition is examined by generating accurate…
Using high-precision Monte-Carlo simulations based on a parallel version of the Wang-Landau algorithm and finite-size scaling techniques we study the effect of quenched disorder in the crystal-field coupling of the Blume-Capel model on the…
We introduce a Monte-Carlo algorithm for the simulation of charged particles moving in the continuum. Electrostatic interactions are not instantaneous as in conventional approaches, but are mediated by a constrained, diffusing electric…
We use the single-cluster Monte Carlo update algorithm to simulate the three-dimensional classical Heisenberg model in the critical region on simple cubic lattices of size $L^3$ with $L=12, 16, 20, 24, 32, 40$, and $48$. By means of…
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same…