Related papers: A comparison of cluster algorithms for the bond-di…
A continuous time cluster algorithm for two-level systems coupled to a dissipative bosonic bath is presented and applied to the sub-ohmic spin-Boson model. When the power s of the spectral function J(w) \propto w^s is smaller than 1/2, the…
We propose a method based on the discrete truncated Wigner approximation (DTWA) for computing out-of-time-order correlators. This method is applied to long-range interacting quantum spin systems where the interactions decay as a power law…
We consider a new formulation of the stochastic coupled cluster method in terms of the similarity transformed Hamiltonian. We show that improvement in the granularity with which the wavefunction is represented results in a reduction in the…
We introduce a novel variance-reducing Monte Carlo algorithm for accurate determination of autocorrelation times. We apply this method to two-dimensional Ising systems with sizes up to $15 \times 15$, using single-spin flip dynamics, random…
Spin chains with open boundaries, such as the transverse field Ising model, can display coherence times for edge spins that diverge with the system size as a consequence of almost conserved operators, the so-called strong zero modes. Here,…
We study the sampling problem for the ferromagnetic Ising model with consistent external fields, and in particular, Swendsen-Wang dynamics on this model. We introduce a new grand model unifying two closely related models: the subgraph world…
A quantum Monte Carlo algorithm for the transverse Ising model with arbitrary short- or long-range interactions is presented. The algorithm is based on sampling the diagonal matrix elements of the power series expansion of the density…
In the Correlation Clustering problem we are given $n$ nodes, and a preference for each pair of nodes indicating whether we prefer the two endpoints to be in the same cluster or not. The output is a clustering inducing the minimum number of…
We show that linear congruential pseudo-random-number generators can cause systematic errors in Monte Carlo simulations using the Swendsen-Wang algorithm, if the lattice size is a multiple of a very large power of 2 and one random number is…
Using the newly proposed probability-changing cluster (PCC) Monte Carlo algorithm, we simulate the two-dimensional (2D) site-diluted Ising model. Since we can tune the critical point of each random sample automatically with the PCC…
The critical behaviour of a bond-disordered Ashkin-Teller model on a square lattice is investigated by intensive Monte-Carlo simulations. A duality transformation is used to locate a critical plane of the disordered model. This critical…
A general technique of exact calculation of any correlation functions for the special class of one-dimensional spin models containing small clusters of quantum spins assembled to a chain by alternating with the single Ising spins is…
We introduce a weighed-loop algorithm that is applicable to any weighed graph network. It is designed to prefer a route of energetically unfavourable bonds in the lattice that can then be flipped without changing the structure inside and…
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…
Recovering properties of correlation functions is typically challenging. On one hand, experimentally, it requires measurements with a temporal resolution finer than the system's dynamics. On the other hand, analytical or numerical analysis…
We have investigated the anomalous scaling behaviour of the Ising model on small-world networks based on 2- and 3-dimensional lattices using Monte Carlo simulations. Our main result is that even at low $p$, the shift in the critical…
The paper focuses on mining patterns that are characterized by a fuzzy lagged relationship between the data objects forming them. Such a regulatory mechanism is quite common in real life settings. It appears in a variety of fields: finance,…
We consider the Ising model on a small-world network, where the long-range interaction strength $J_2$ is in general different from the local interaction strength $J_1$, and examine its relaxation behaviors as well as phase transitions. As…
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a…
We study the dynamic critical behavior of a Swendsen--Wang--type algorithm for the Ashkin--Teller model. We find that the Li--Sokal bound on the autocorrelation time ($\tau_{{\rm int},{\cal E}} \ge {\rm const} \times C_H$) holds along the…