Related papers: Numerical simulation study of the dynamical behavi…
High-dimensional limit theorems have been shown useful to derive tuning rules for finding the optimal scaling in random-walk Metropolis algorithms. The assumptions under which weak convergence results are proved are however restrictive: the…
A cluster algorithm is presented for the $Z_2$ Kalb-Ramond plaquette model in four dimensions which dramatically reduces critical slowing. The critical exponent $z$ is reduced from $ z>2$ (standard Metropolis algorithm) to $z= 0.32\pm0.06$.…
We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at $q=2$ is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic…
We review the local Monte Carlo dynamics and Swendsen-Wang cluster algorithm. We introduce and analyze a new Monte Carlo dynamics known as transitional Monte Carlo. The transitional Monte Carlo algorithm samples energy probability…
Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this…
The Wolff dynamics is a non-local Markov chain widely used for simulating the Ising model due to its effectiveness in reducing critical slowing down compared to the Glauber dynamics. Despite extensive algorithmic and numerical studies, a…
We have defined a new type of clustering scheme preserving the connectivity of the nodes in network ignored by the conventional Migdal-Kadanoff bond moving process. Our new clustering scheme performs much better for correlation length and…
We study the early time dynamics of bimodal spin systems on $2d$ lattices evolving with different microscopic stochastic updates. We treat the ferromagnetic Ising model with locally conserved order parameter (Kawasaki dynamics), the same…
Dynamical behavior of the clusters during relaxation is studied in two-dimensional Potts model using cluster algorithm. Average cluster size and cluster formation velocity are calculated on two different lattice sizes for different number…
We derive mostly analytically the scaling behavior of the number of nonfrozen and relevant nodes in critical Kauffman networks (with two inputs per node) in the thermodynamic limit. By defining and analyzing a stochastic process that…
Inspired by the multicanonical approach to simulations of first-order phase transitions we propose for $q$-state Potts models a combination of cluster updates with reweighting of the bond configurations in the…
Dilute dipolar Ising magnets remain a notoriously hard problem to tackle both analytically and numerically because of long-ranged interactions between spins as well as rare region effects. We study a new type of anisotropic dilute dipolar…
Cluster growth in a coagulating system of active particles (such as microswimmers in a solvent) is studied by theory and simulation. In contrast to passive systems, the net velocity of a cluster can have various scalings dependent on the…
Unconcatenated, unknotted polymer rings in the melt are subject to strong interactions with neighboring chains due to the presence of topological constraints. We study this by computer simulation using the bond-fluctuation algorithm for…
The corrections to finite-size scaling in the critical two-point correlation function G(r) of 2D Ising model on a square lattice have been studied numerically by means of exact transfer-matrix algorithms. The systems have been considered,…
The development of physical simulators, called Ising machines, that sample from low energy states of the Ising Hamiltonian has the potential to drastically transform our ability to understand and control complex systems. However, most of…
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,…
Cluster Monte Carlo algorithms are widely regarded as the most effective route to overcoming critical slowing down in lattice spin systems. Whether this acceleration persists in the presence of vacancies and multicritical fluctuations,…
Exactly solving a spinless fermionic system in two and three dimensions, we investigate the scaling behavior of the block entropy in critical and non-critical phases. The scaling of the block entropy crucially depends on the nature of the…
We show that high-temperature expansions may serve as a basis for the novel approach to efficient Monte Carlo simulations. "Worm" algorithms utilize the idea of updating closed path configurations (produced by high-temperature expansions)…