Related papers: Reduced critical slowing down for statistical phys…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
We investigate the behavior of the deviation of the estimator for the density of states (DOS) with respect to the exact solution in the course of Wang-Landau and Stochastic Approximation Monte Carlo (SAMC) simulations of the two-dimensional…
We employ the machinery of smooth scaling and coarse-graining of observables, developed recently by us in the context of so-called fluctuation operators (inspired by prior work of Verbeure et al) to make a rigorous renormalisation group…
We study the dynamic critical behavior of the multi-grid Monte Carlo (MGMC) algorithm with piecewise-constant interpolation and a W-cycle, applied to the one-dimensional $O(4)$-symmetric nonlinear $\sigma$-model [= $SU(2)$ principal chiral…
We analyze the autocorrelations for the LHMC algorithm in the context of free field theory. In this case this is just Adler's overrelaxation algorithm. We consider the algorithm with even/odd, lexicographic, and random updates, and show…
Nonequilibrium relaxation behaviors in the Ising model on a square lattice based on the Wolff algorithm are totally different from those based on local-update algorithms. In particular, the critical relaxation is described by the…
We consider second-order phase transitions in which the order parameter is a replicated overlap matrix. We focus on a tricritical point that occurs in a variety of mean-field models and that, more generically, describes higher order…
We propose and test a scheme for entanglement renormalization capable of addressing large two-dimensional quantum lattice systems. In a translationally invariant system, the cost of simulations grows only as the logarithm of the lattice…
The Ising model doesn't have a strictly defined dynamics, only a spectrum. There are different ways to equip it with a time dependence e.g. the Glauber or the Kawasaki dynamics, which are both stochastic, but it means there is a master…
We generalize the Kuramoto model for the synchronization transition of globally coupled phase oscillators to populations by incorporating an additional heterogeneity with the coupling strength, where each oscillator pair interacts with…
We study the imaginary-time relaxation critical dynamics of a quantum system with a vanishing initial correlation length and an arbitrary initial order parameter $M_0$. We find that in quantum critical dynamics, the behavior of $M_0$ under…
In this paper we combine two powerful computational techniques, well-tempered metadynamics and time lagged independent component analysis. The aim is to develop a new tool for studying rare events and exploring complex free energy…
Isolated quantum systems follow the unitary evolution, which guarantees the full many body state always keeps a constant entropy as its initial one. In comparison, the local subsystems exhibit relaxation behavior and evolve towards certain…
We study the convergence properties of Glauber dynamics for the random field Ising model (RFIM) with ferromagnetic interactions on finite domains of $\mathbb{Z}^d$, $d \ge 2$. Of particular interest is the Griffiths phase where correlations…
We propose a strategy to achieve the fastest convergence in the Wang-Landau algorithm with varying modification factors. With this strategy, the convergence of a simulation is at least as good as the conventional Monte Carlo algorithm, i.e.…
We present a mathematical analysis of the Wang-Landau algorithm, prove its convergence, identify sources of errors and strategies for optimization. In particular, we found the histogram increases uniformly with small fluctuation after a…
In spin systems such as the Ising model, the local order and disorder can be characterized by the order-parameter and energy density profiles $\langle \sigma ({\bf r}_1) \rangle$ and $\langle \epsilon ({\bf r}_2) \rangle$, respectively.…
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…
In this paper, we demonstrate the efficiency of simulations via direct computation of the partition function under various macroscopic conditions, such as different temperatures or volumes. The method can compute partition functions by…
We provide analysis of the convergence properties and applicability extensions of flat-histogram algorithms, with a particular focus on the Wang-Landau algorithms (exemplified by converging stochastic approximation Monte Carlo (SAMC)) and…