Related papers: A comparison of cluster algorithms for the bond-di…
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…
We study the phase transition of the classical $XY$ model on a diamond lattice by Monte Carlo simulations using the Wolff cluster algorithm. Finite-size scaling (FSS) analysis of the Binder cumulant and the second-moment correlation length…
An efficient Monte Carlo algorithm for the simulation of spin models with long-range interactions is discussed. Its central feature is that the number of operations required to flip a spin is independent of the number of interactions…
In this communication, the convergence of the 1/t and Wang - Landau algorithms in the calculation of multidimensional numerical integrals is analyzed. Both simulation methods are applied to a wide variety of integrals without restrictions…
We investigate the dynamical spreading of spatial correlations after a quantum quench starting from a magnetically disordered state in the transverse-field Ising model at one (1D) and two spatial dimensions (2D). We analyze specifically the…
The low temperature dynamics of the two- and three-dimensional Ising spin glass model with Gaussian couplings is investigated via extensive Monte Carlo simulations. We find an algebraic decay of the remanent magnetization. For the…
A spin-1/2 Ising model, defined in the body centered cubic lattice, is used to describe some of the thermodynamic properties of Fe$_p$-Al$_q$ alloys, with $p+q=1$. The model assumes, besides the nearest-neighbor exchange coupling, the…
We describe a number of recently developed cluster-flipping algorithms for the efficient simulation of classical spin models near their critical temperature. These include the algorithms of Wolff, Swendsen and Wang, and Niedermeyer, as well…
Saddle point problems arise from many wireless applications, and primal-dual iterative algorithms are widely applied to find the saddle points. In the existing literature, the convergence results of such algorithms are established assuming…
We study the dynamical properties of the random transverse-field Ising chain at criticality using a mapping to free fermions, with which we can obtain numerically exact results for system sizes, L, as large as 256. The probability…
We present preliminary results of our numerical study of the critical dynamics of percolation observables for the two-dimensional Ising model. We consider the (Monte-Carlo) short-time evolution of the system obtained with a local heat-bath…
The iteration dynamics of the coupled cluster equations exhibits a synergistic relationship among the cluster amplitudes. The iteration scheme may be viewed as a multivariate discrete-time propagation of nonlinearly coupled equations, which…
We compare the correlation times of the Sweeny and Gliozzi dynamics for two-dimensional Ising and three-state Potts models, and the three-dimensional Ising model for the simulations in the percolation prepresentation. The results are also…
We study the $q$-state ferromagnetic Potts model on the $n$-vertex complete graph known as the mean-field (Curie-Weiss) model. We analyze the Swendsen-Wang algorithm which is a Markov chain that utilizes the random cluster representation…
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point. By combining the replica-exchange algorithm with cluster updates…
Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for…
DTW calculates the similarity or alignment between two signals, subject to temporal warping. However, its computational complexity grows exponentially with the number of time-series. Although there have been algorithms developed that are…
We propose a cluster simulation algorithm for statistical ensembles with fixed order parameter. We use the tethered ensemble, which features Helmholtz's effective potential rather than Gibbs's free energy, and in which canonical averages…
A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical…
Motivated by recent progress on the scaling behavior of entanglement entropy, we study the scaling behavior of the number of clusters crossing the boundary between two subsystems for several classical statistical models in two dimension.…