Related papers: Embedding Z(3) in SU(3)
We report developments of the kinetic Monte Carlo (KMC) method with improved accuracy and increased versatility for the description of atomic diffusivity on metal surfaces. The on-lattice constraint built into our recently proposed…
A local embedding and effective downfolding scheme has been developed and implemented in the auxiliary-field quantum Monte Carlo (AFQMC) method. A local cluster in which electrons are fully correlated is defined and the frozen orbital…
A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of…
We present a novel, generally applicable Monte Carlo algorithm for the simulation of fluid systems. Geometric transformations are used to identify clusters of particles in such a manner that every cluster move is accepted, irrespective of…
This study presents a semi-nonparametric Latent Class Choice Model (LCCM) with a flexible class membership component. The proposed model formulates the latent classes using mixture models as an alternative approach to the traditional random…
The Hybrid Monte Carlo algorithm is adapted to the simulation of a system of classical degrees of freedom coupled to non self-interacting lattices fermions. The diagonalization of the Hamiltonian matrix is avoided by introducing a…
This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…
We introduce an efficient, scalable Monte Carlo algorithm to simulate cross-linked architectures of freely-jointed and discrete worm-like chains. Bond movement is based on the discrete tractrix construction, which effects conformational…
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…
Compact polymers are self-avoiding random walks which visit every site on a lattice. This polymer model is used widely for studying statistical problems inspired by protein folding. One difficulty with using compact polymers to perform…
We review the background of the cluster algorithms in Monte Carlo simulation of statistical physics problems. One of the first such successful algorithm was developed by Swendsen and Wang eight years ago. In contrast to the local…
As a characteristic property of all quantum systems, entanglement participates in many important quantum phenomena. In this proceeding, we employ it in the study of quantum field theories at finite density. We incorporate evaluations of…
We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study…
We construct a non Abelian model for SU(2) QCD in Euclidean three-dimensional spacetime and study its different phases. The model contains a center vortex sector coupled to a dual effective field encoding information about how the vortices…
The increase with time of computer resources devoted to simulations of full QCD is spectacular. Yet the reduction of systematic errors is comparatively slow. This is due to the algorithmic complexity of the problem. I review, in elementary…
We study the iteration of block spin transformations in the O(3) symmetric non-linear sigma-model on a two-dimensional square lattice with help of the Monte Carlo method. In contrast to the classical Monte Carlo Renormalization Group…
We discuss a class of saddle-point configurations in SU(2) lattice gauge theory in three Euclidean dimensions. These configurations are smooth on the scale of the lattice and have an action density exhibiting localized peaks, as has been…
Bridging algorithms are global Monte Carlo moves which allow for an efficient sampling of single polymer chains. In this manuscript we discuss the adaptation of three bridging algorithms from lattice to continuum models, and give details on…
We present a formalism for simulating quantum dynamics of lattice spin-one systems by first introducing local hidden variables and then doing semiclassical (truncated Wigner) approximation in the extended phase space. In this way we exactly…
The principle and the efficiency of the Monte Carlo transfer-matrix algorithm are discussed. Enhancements of this algorithm are illustrated by applications to several phase transitions in lattice spin models. We demonstrate how the…