相关论文: Low-Temperature Long-Time Simulations of Ising Fer…
The metastable lifetime of the square-lattice and simple-cubic-lattice kinetic Ising models are studied in the low-temperature limit. The simulations are performed using Monte Carlo with Absorbing Markov Chain algorithms to simulate…
We present the Monte Carlo with Absorbing Markov Chains (MCAMC) method for extremely long kinetic Monte Carlo simulations. The MCAMC algorithm does not modify the system dynamics. It is extremely useful for models with discrete state spaces…
This discussion serves as an introduction to the use of Monte Carlo simulations as a useful way to evaluate the observables of a ferromagnet. Key background is given about the relevance and effectiveness of this stochastic approach and in…
A class of Monte Carlo algorithms which incorporate absorbing Markov chains is presented. In a particular limit, the lowest-order of these algorithms reduces to the $n$-fold way algorithm. These algorithms are applied to study the escape…
Binary magnetic square lattice Ising system with nearest neighbour interactions were simulated using the Monte Carlo technique. Two types of ions were randomly distributed on the lattice sites, one type interacting ferromagnetic and the…
We derive a direct connection between Monte Carlo time and physical time in terms of physical parameters, using a quantum Hamiltonian with a $d$-dimensional phonon heat bath interacting with a square-lattice Ising ferromagnet. Based on the…
An efficient method for computing thermodynamic equilibrium states at the micromagnetic length scale is introduced, using the Markov chain Monte Carlo method. Trial moves include not only rotations of vectors, but also a change in their…
In dynamic Monte Carlo simulations, using for example the Metropolis dynamic, it is often required to simulate for long times and to simulate large systems. We present an overview of advanced algorithms to simulate for larger times and to…
A cluster Monte Carlo method for systems of classical spins with purely dipolar couplings is presented. It is tested and applied for finite arrays of perpendicular Ising dipoles on the triangular lattice. This model is a modification with…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
We present the numerical results for low temperature behavior of the transverse-field Ising model on a frustrated checkerboard lattice, with focus on the effect of both quantum and thermal fluctuations. Applying the recently-developed…
The Ising model is a simple statistical model for ferromagnetism. There are analytic solutions for low dimensions and very efficient Monte Carlo methods, such as cluster algorithms, for simulating this model in special cases. However most…
Lattice simulations are an important class of problems in crystalline solids, surface science, alloys, adsorption, absorption, separation, catalysis, to name a few. We describe a fast computational method for performing lattice…
While the 3d Ising model has defied analytic solution, various numerical methods like Monte Carlo, MCRG and series expansion have provided precise information about the phase transition. Using Monte Carlo simulation that employs the Wolff…
In lattice quantum field theory studies, parameters defining the lattice theory must be tuned toward criticality to access continuum physics. Commonly used Markov chain Monte Carlo (MCMC) methods suffer from critical slowing down in this…
Monte Carlo (MC) simulations of lattice models are a widely used way to compute thermodynamic properties of substitutional alloys. A limitation to their more widespread use is the difficulty of driving a MC simulation in order to obtain the…
Optimizing or sampling complex cost functions of combinatorial optimization problems is a longstanding challenge across disciplines and applications. When employing family of conventional algorithms based on Markov Chain Monte Carlo (MCMC)…
The Markov chain Monte Carlo (MCMC) method is used to evaluate the imaginary-time path integral of a quantum oscillator with a potential that includes both a quadratic term and a quartic term whose coupling is varied by several orders of…
Accept-reject based Markov chain Monte Carlo (MCMC) methods are the workhorse algorithm for Bayesian inference. These algorithms, like Metropolis-Hastings, require choosing a proposal distribution which is typically informed by the desired…
Monte Carlo simulations using entropic sampling to estimate the number of configurations of a given energy are a valuable alternative to traditional methods. We introduce {\it tomographic} entropic sampling, a scheme which uses multiple…