Related papers: Simulations on Infinite Size Lattices
We propose a method for Monte Carlo simulations of systems with a complex action. The method has the advantages of being in principle applicable to any such system and provides a solution to the overlap problem. In some cases, like in the…
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…
Monte Carlo methods play important part in modern statistical physics. The application of these methods suffer from two main difficulties.The first is caused by the relatively small number of particles that can participate in any numerical…
Monte-Carlo simulations are routinely used for estimating the scaling exponents of complex systems. However, due to finite-size effects, determining the exponent values is often difficult and not reliable. Here we present a novel technique…
A review of the Loop Algorithm, its generalizations, and its relation to some other Monte Carlo techniques is given. The loop algorithm is a Quantum Monte Carlo procedure which employs nonlocal changes of worldline configurations,…
Many spin systems affected by critical slowing down can be efficiently simulated using cluster algorithms. Where such systems have long-range interactions, suitable formulations can additionally bring down the computational effort for each…
With the developed "extended Monte Calro" (EMC) algorithm, we have studied the depinning transition in Ising-type lattice models by extensive numerical simulations, taking the random-field Ising model with a driving field and the driven…
If a stochastic system during some periods of its evolution can be divided into non-interacting parts, the kinetics of each part can be simulated independently. We show that this can be used in the development of efficient Monte Carlo…
We consider the one-dimensional quantum-statistical problem of interacting spin-less particles in an infinite deep potential valley and on a ring. Several limits for the applicability of the Quantum Monte Carlo (QMC) methods were revealed…
A theta-term, which couples to topological charge, is added to the two-dimensional lattice CP^3 model and U(1) gauge theory. Monte Carlo simulations are performed and compared to strong-coupling character expansions. In certain instances, a…
Monte Carlo simulations of quantum field theories on a lattice become increasingly expensive as the continuum limit is approached since the cost per independent sample grows with a high power of the inverse lattice spacing. Simulations on…
We propose a method for Monte Carlo simulations of systems with a complex action. The method has the advantages of being in principle applicable to any such system and provides a solution to the overlap problem. We apply it in random matrix…
Monte Carlo simulation using a cluster algorithm is used to compute the scaling part of the free energy for a three dimensional O(4) spin model. The results are relevant for analysis of lattice studies of high temperature QCD.
We investigate the ground-state properties of the highly degenerate non-coplanar phase of the classical bilinear-biquadratic Heisenberg model on the triangular lattice with Monte Carlo simulations. For that purpose, we introduce an Ising…
We present an algorithm to simulate two-dimensional quantum lattice systems in the thermodynamic limit. Our approach builds on the {\em projected entangled-pair state} algorithm for finite lattice systems [F. Verstraete and J.I. Cirac,…
Two-dimensional $CP^{N-1}$ models are investigated by Monte Carlo methods on the lattice, for values of $N$ ranging from 2 to 21. Scaling and rotation invariance are studied by comparing different definitions of correlation length $\xi$.…
We have simulated the three-dimensional Heisenberg model on simple cubic lattices, using the single-cluster Monte Carlo update algorithm. The expected pronounced reduction of critical slowing down at the phase transition is verified. This…
We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its…
A quantum Monte Carlo algorithm for the transverse Ising model with arbitrary short- or long-range interactions is presented. The algorithm is based on sampling the diagonal matrix elements of the power series expansion of the density…
The behavior of the one-dimensional random-force-driven Burgers equation is investigated in the path integral formalism on a discrete space-time lattice. We show that by means of Monte Carlo methods one may evaluate observables, such as…