Related papers: Worm Algorithm for CP(N-1) Model
We present and compare new types of algorithms for lattice QCD with staggered fermions in the limit of infinite gauge coupling. These algorithms are formulated on a discrete spatial lattice but with continuous Euclidean time. They make use…
We perform Monte Carlo simulations of the CP$^{N-1}$ model on the square lattice for $N=10$, $21$, and $41$. Our focus is on the severe slowing down related to instantons. To fight this problem we employ open boundary conditions as proposed…
Based on the worm algorithm in the path-integral representation, we propose a general quantum Monte Carlo algorithm suitable for parallelizing on a distributed-memory computer by domain decomposition. Of particular importance is its…
We present an exact version of the local bosonic algorithm for the simulation of dynamical quarks in lattice QCD. This version is based on a non-hermitian polynomial approximation of the inverse of the quark matrix. A Metropolis test…
The dual form of the massless Schwinger model on the lattice overcomes the complex action problems from two sources: a topological term, as well as non-zero chemical potential, making these physically interesting cases accessible to Monte…
Lattice QCD in the strong coupling regime can be formulated in dual variables which are integer-valued. It can be efficiently simulated for modest finite temperatures and finite densities via the worm algorithm, circumventing the finite…
We study a contact process (CP) with two species that interact in a symbiotic manner. In our model, each site of a lattice may be vacant or host individuals of species A and/or B; multiple occupancy by the same species is prohibited.…
The worm algorithm is a versatile technique in the Markov chain Monte Carlo method for both classical and quantum systems. The algorithm substantially alleviates critical slowing down and reduces the dynamic critical exponents of various…
In this paper we study a 3D lattice spin model of CP$^1$ Schwinger-bosons coupled with dynamical compact U(1) gauge bosons. The model contains two parameters; the gauge coupling and the hopping parameter of CP$^1$ bosons. At large (weak)…
We develop a stochastic whole-brain and body simulator of the nematode roundworm Caenorhabditis elegans (C. elegans) and show that it is sufficiently regularizing to allow imputation of latent membrane potentials from partial calcium…
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…
We study aspects concerning numerical simulations of Lattice QCD with two flavors of dynamical Ginsparg-Wilson quarks with degenerate masses. A Hybrid Monte Carlo algorithm is described and the formula for the fermionic force is derived for…
The properties of interacting bosons in a weak, one-dimensional, and bichromatic optical with a rational ratio of the constituting wavelengths $\lambda_1$ and $\lambda_2$ are numerically examined along a broad range of the Lieb-Liniger…
Lattice regularization of chiral fermions is an important development of the theory of elementary particles. Nontheless, brute force computer simulations are very expensive, if not prohibitive. In this letter I exploit the non-interacting…
We calculate the strange quark content of the nucleon in 2+1-flavor lattice QCD. Chirally symmetric overlap fermion formulation is used to avoid the contamination from up and down quark contents due to an operator mixing between strange and…
The Cellular Potts Model (CPM) is a lattice based modeling technique which is widely used for simulating cellular patterns such as foams or biological tissues. Despite its realism and generality, the standard Monte Carlo algorithm used in…
Nonreversible Markov chains can outperform reversible chains in the Markov chain Monte Carlo method. Lifting is a versatile approach to introducing net stochastic flow in state space and constructing a nonreversible Markov chain. We present…
We apply the higher-order tensor renormalization group to the lattice CP($N-1$) model in two dimensions. A tensor network representation of the CP($N-1$) model in the presence of the $\theta$ term is derived. We confirm that the numerical…
Results of a systematic lattice QCD simulation with two degenerate flavors of sea quarks, identified as dynamical u and d quarks, are presented. The simulation was performed on a dedicated parallel computer, called CP-PACS, developed at the…
We investigate the phase diagram and critical behavior of a three-dimensional lattice CP(N-1) model in the large-N limit. Numerical evidence of first-order transitions is always observed for sufficiently large values of N, i.e. N>2 up to…