Related papers: Cluster Monte Carlo and dynamical scaling for long…
Monte Carlo simulations of the 1D Ising model with ferromagnetic interactions decaying with distance $r$ as $1/r^{1+\sigma}$ are performed by applying the Swendsen-Wang cluster algorithm with cumulative probabilities. The critical behavior…
The current understanding of aging phenomena is mainly confined to the study of systems with short-ranged interactions. Little is known about the aging of long-ranged systems. Here, the aging in the phase-ordering kinetics of the…
A cluster Monte Carlo method for systems of classical spins with purely dipolar couplings is presented. It is tested and applied for finite arrays of perpendicular Ising dipoles on the triangular lattice. This model is a modification with…
We propose a number of Monte Carlo algorithms for the simulation of ice models and compare their efficiency. One of them, a cluster algorithm for the equivalent three colour model, appears to have a dynamic exponent close to zero, making it…
Machine learning systems increasingly depend on pipelines of multiple algorithms to provide high quality and well structured predictions. This paper argues interaction effects between clustering and prediction (e.g. classification,…
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…
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 present a Monte Carlo method to compute efficiently susceptibilites or covariances of two physical variables. The method relies on a generalization of the exchange cluster algorithm to any model of interacting particles with any $2$-body…
We propose an algorithm to obtain numerically approximate solutions of the direct Ising problem, that is, to compute the free energy and the equilibrium observables of spin systems with arbitrary two-spin interactions. To this purpose we…
We present the results of extensive Monte Carlo simulations of Ising models with algebraically decaying ferromagnetic interactions in the regime where classical critical behavior is expected for these systems. We corroborate the values for…
We present a method which extends Monte Carlo studies to situations that require a large dynamic range in particle number. The underlying idea is that, in order to calculate the collisional evolution of a system, some particle interactions…
We describe a generalized scheme for the probability-changing cluster (PCC) algorithm, based on the study of the finite-size scaling property of the correlation ratio, the ratio of the correlation functions with different distances. We…
We consider dynamically constrained Monte-Carlo dynamics and show that this leads to the generation of long ranged effective interactions. This allows us to construct a local algorithm for the simulation of charged systems without ever…
We discuss a new Monte Carlo algorithm for the simulation of complex fluids. This algorithm employs geometric operations to identify clusters of particles that can be moved in a rejection-free way. It is demonstrated that this geometric…
Monte Carlo simulation using the standard single-spin flip algorithm often fails to sample over the entire configuration space at low temperatures for frustrated spin systems. A typical example is a class of spin-ice type Ising models. In…
In online clustering problems, there is often a large amount of uncertainty over possible cluster assignments that cannot be resolved until more data are observed. This difficulty is compounded when clusters follow complex distributions, as…
A kinetic Ising model is analyzed where spin variables correspond to lattice cells with mobile or immobile particles. Introducing additional restrictions for the flip processes according to the n-spin facilitated kinetic Ising model and…
Competition between short- and long-range interactions underpins many emergent phenomena in nature. Despite rapid progress in their experimental control, computational methods capable of accurately simulating open quantum many-body systems…
We propose an efficient Monte Carlo algorithm for simulating a ``hardly-relaxing" system, in which many replicas with different temperatures are simultaneously simulated and a virtual process exchanging configurations of these replica is…
Taking the two-dimensional Ising model for example, short-time behavior of critical dynamics with a conserved order parameter is investigated by Monte Carlo simulations. Scaling behavior is observed, but the dynamic exponent $z$ is updating…