Related papers: Single cluster algorithm for the site-bond-correla…
On directed Barabasi-Albert networks with two and seven neighbours selected by each added site, the Ising model does not seem to show a spontaneous magnetisation. Instead, the decay time for flipping of the magnetisation follows an…
We apply extensive Monte Carlo simulations to study the probability distribution $P(m)$ of the order parameter $m$ for the simple cubic Ising model with periodic boundary condition at the transition point. Sampling is performed with the…
A new algorithm for simulating compact U(1) lattice gauge theory in three dimensions is presented which is based on global changes in the configuration space. We show that this algorithm provides an effective way to extract partition…
We investigate the temperature-dependent behavior emerging in the vicinity of the superfluid (SF) to Mott-insulator (MI) transition of interacting bosons in a two-dimensional optical lattice, described by the Bose-Hubbard model. The…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
We present a progress report on the Cluster Processor, a special-purpose computer system for the Wolff simulation of the three-dimensional Ising model, including an analysis of simulation results obtained thus far. These results allow,…
A combination of recent numerical and theoretical advances are applied to analyze the scaling behaviour of the site-diluted Ising model in two dimensions, paying special attention to the implications for multiplicative logarithmic…
We propose a generalization of the linked-cluster expansions to study driven-dissipative quantum lattice models, directly accessing the thermodynamic limit of the system. Our method leads to the evaluation of the desired extensive property…
Wang-Landau simulations offer the possibility to integrate explicitly over a collective coordinate and stochastically over the remainder of configuration space. We propose to choose the so-called "slow mode", which is responsible for large…
We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the $q$-state Potts model to non-integer values $q>1$. Its results…
In this work we have studied the dynamic scaling behavior of two scaling functions and we have shown that scaling functions obey the dynamic finite size scaling rules. Dynamic finite size scaling of scaling functions opens possibilities for…
We use Numerical Linked Cluster Expansions (NLCE) to study the site diluted transverse-field Ising model on the square-lattice at $T=0$. NLCE with a self-consistent mean-field on the boundary of the clusters is used to obtain the ground…
Bond propagation and site propagation algorithm are extended to the two dimensional Ising model with a surface field. With these algorithms we can calculate the free energy, internal energy, specific heat, magnetization, correlation…
We study the phase diagram of a class of models in which a generalized cluster interaction can be quenched by Ising exchange interaction and external magnetic field. We characterize the various phases through winding numbers. They may be…
We study the 2-dimensional Ising model at critical temperature on a simply connected subset $\Omega_{\delta}$ of the square grid $\delta\mathbb{Z}^{2}$. The scaling limit of the critical Ising model is conjectured to be described by…
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…
Many spin systems affected by critical slowing down can be efficiently simulated using cluster algorithms. Where such systems have long-range interactions, suitable formulations can additionally bring down the computational effort for each…
We present a fine-grained approach to identify clusters and perform percolation analysis in a 2D lattice system. In our approach, we develop an algorithm based on the linked-list data structure whereby the members of a cluster are nodes of…
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…
Randomly coupled Ising spins constitute the classical model of collective phenomena in disordered systems, with applications covering ferromagnetism, combinatorial optimization, protein folding, stock market dynamics, and social dynamics.…