Related papers: Monte Carlo Algorithms For the Fully Frustrated XY…
We analyze the kinematics of multigrid Monte Carlo algorithms by investigating acceptance rates for nonlocal Metropolis updates. With the help of a simple criterion we can decide whether or not a multigrid algorithm will have a chance to…
Monte Carlo simulation is an unbiased numerical tool for studying classical and quantum many-body systems. One of its bottlenecks is the lack of general and efficient update algorithm for large size systems close to phase transition or with…
We introduce a Metropolis-Hastings Markov chain for Boltzmann distributions of classical spin systems. It relies on approximate tensor network contractions to propose correlated collective updates at each step of the evolution. We present…
Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for…
We propose a novel technique for speeding up the self-learning Monte Carlo method applied to the single-site impurity model. For the case where the effective Hamiltonian is expressed by polynomial functions of differences of imaginary-time…
We present a sub-matrix update algorithm for the continuous-time auxiliary field method that allows the simulation of large lattice and impurity problems. The algorithm takes optimal advantage of modern CPU architectures by consistently…
Recently, Velazquez and Curilef have proposed a methodology to extend Monte Carlo algorithms based on canonical ensemble, which is aimed to overcome slow sampling problems associated with temperature-driven discontinuous phase transitions.…
The critical relaxation from the low-temperature ordered state of the three-dimensional fully frustrated Ising model on a simple cubic lattice has been studied using the short time dynamics method. Particles with the periodic boundary…
We construct efficient Monte Carlo updating algorithms for two classes of pure SU(N) lattice gauge actions with non-linear dependence on the link variables. Our construction generalises the method of auxiliary variables used by Fabricius…
We investigate the performance of the hybrid Monte Carlo algorithm, the standard algorithm used for lattice QCD simulations involving fermions, in updating non-trivial global topological structures. We find that the hybrid Monte Carlo…
We study the kinematics of multigrid Monte Carlo algorithms by means of acceptance rates for nonlocal Metropolis update proposals. An approximation formula for acceptance rates is derived. We present a comparison of different coarse-to-fine…
Monte Carlo simulations have boosted the numerical study of several different physical systems and in particular, the canonical ensemble has been especially useful because of the existence of easy and efficient relaxation algorithms…
The standard kinetic Monte Carlo algorithm is an extremely efficient method to carry out serial simulations of dynamical processes such as thin-film growth. However, in some cases it is necessary to study systems over extended time and…
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…
We propose a new algorithm which works effectively in global updates in Monte Carlo study. We apply it to the quantum spin chain with next-nearest-neighbor interactions. We observe that Monte Carlo results are in excellent agreement with…
We present an improved Metropolis algorithm for arbitrary hard core systems in any dimensions. In the new updating scheme the conventional Metropolis step of a single particle is replaced by a collective step of a chain of particles. For…
The self-organized Monte Carlo simulations of 2D Ising ferromagnet on the square lattice are performed. The essence of devised simulation method is the artificial dynamics consisting of the single-spin-flip algorithm of Metropolis…
Using Monte Carlo simulations, we systematically investigate the non-equilibrium dynamics of the chiral degree of freedom in the two-dimensional fully frustrated XY model. The critical initial increase of the staggered chiral magnetization…
We investigate the performance of the hybrid Monte Carlo algorithm in updating non-trivial global topological structures. We find that the hybrid Monte Carlo algorithm has serious problems decorrelating the global topological charge. This…
We apply the event-chain Monte Carlo algorithm to classical continuum spin models on a lattice and clarify the condition for its validity. In the two-dimensional XY model, it outperforms the local Monte Carlo algorithm by two orders of…