Related papers: Generalized cluster algorithms for Potts lattice g…
A novel family of dynamical Monte Carlo algorithms for lattice polymers is proposed. Our central idea is to simulate an extended ensemble in which the self-avoiding condition is systematically weakened. The degree of the self-overlap is…
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 report on large-scale Wang-Landau Monte Carlo simulations of the critical behavior of two spin models in two- (2d) and three-dimensions (3d), namely the 2d random-bond Ising model and the pure 3d Blume-Capel model at zero crystal-field…
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…
The simulation of spin models close to critical points of continuous phase transitions is heavily impeded by the occurrence of critical slowing down. A number of cluster algorithms, usually based on the Fortuin-Kasteleyn representation of…
The emergence of collective oscillations and synchronization is a widespread phenomenon in complex systems. While widely studied in dynamical systems theory, this phenomenon is not well understood in the context of out-of-equilibrium phase…
We investigate the computational hardness of spin-glass instances on a square lattice, generated via a recently introduced tunable and scalable approach for planting solutions. The method relies on partitioning the problem graph into…
We study a Monte Carlo algorithm that is based on a specific (randomly shifted and dilated) lattice point set. The main result of this paper is that the mean squared error for a given compactly supported, square-integrable function is…
This paper considers clustered multi-task compressive sensing, a hierarchical model that solves multiple compressive sensing tasks by finding clusters of tasks that leverage shared information to mutually improve signal reconstruction. The…
While statisticians are well-accustomed to performing exploratory analysis in the modeling stage of an analysis, the notion of conducting preliminary general-purpose exploratory analysis in the Monte Carlo stage (or more generally, the…
We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices of Delaunay type with up to 80\,000 sites. By applying reweighting techniques and finite-size scaling analyses…
This paper provides a convergence analysis for generalized Hamiltonian Monte Carlo samplers, a family of Markov Chain Monte Carlo methods based on leapfrog integration of Hamiltonian dynamics and kinetic Langevin diffusion, that encompasses…
The Ising model S=1/2 and the S=1 model are studied by efficient Monte Carlo schemes on the (3,4,6,4) and the (3,3,3,3,6) Archimedean lattices. The algorithms used, a hybrid Metropolis-Wolff algorithm and a parallel tempering protocol, are…
Using D-theory we construct a new efficient cluster algorithm for the Ising model. The construction is very different from the standard Swendsen-Wang algorithm and related to worm algorithms. With the new algorithm we have measured the…
We consider the problem of sampling from the ferromagnetic Potts and random-cluster models on a general family of random graphs via the Glauber dynamics for the random-cluster model. The random-cluster model is parametrized by an edge…
We consider the design of a non-local MonteCarlo algorithm for $SU(3)$ lattice systems according to the idea of {\em embedding} the degrees of freedom corresponding to the center of the group $Z(3)$. As a crucial ingredient to reach this…
Monte Carlo simulations are used to study lattice gases of particles with extended hard cores on a two dimensional square lattice. Exclusions of one and up to five nearest neighbors (NN) are considered. These can be mapped onto hard squares…
We study the transverse-field Ising model on a square lattice with bond- and site-dilution at zero temperature by stochastic series expansion quantum Monte Carlo simulations. Tuning the transverse field $h$ and the dilution $p$, the quantum…
We report single-cluster Monte Carlo simulations of the Ising model on three-dimensional Poissonian random lattices with up to 128,000 approx. 503 sites which are linked together according to the Voronoi/Delaunay prescription. For each…
Normal factor graph duality offers new possibilities for Monte Carlo algorithms in graphical models. Specifically, we consider the problem of estimating the partition function of the ferromagnetic Ising and Potts models by Monte Carlo…