Related papers: Swendsen-Wang Algorithm on the Mean-Field Potts Mo…
In this note we study the block spin mean-field Potts model, in which the spins are divided into $s$ blocks and can take $q\ge 2$ different values (colors). Each block is allowed to contain a different proportion of vertices and behaves…
We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs and the low-temperature ferromagnetic Potts model on bounded-degree expander graphs. The results apply,…
The phase transitions of random-field q-state Potts models in d=3 dimensions are studied by renormalization-group theory by exact solution of a hierarchical lattice and, equivalently, approximate Migdal-Kadanoff solutions of a cubic…
We demonstrate that the invaded cluster algorithm, recently introduced by Machta et al, is a fast and reliable tool for determining the critical temperature and the magnetic critical exponent of periodic and aperiodic ferromagnetic Ising…
Few years ago, application of the mean field Bethe scheme on a given system was shown to produce a systematic change of the system intrinsic symmetry. For instance, once applied on a ferromagnet, individual spins are no more equivalent.…
In this paper we investigate the relationship between the mixing times of the Glauber dynamics of a statistical mechanical system with its thermodynamic equilibrium structure. For this we consider the mean-field Blume-Capel model, one of…
This note introduces the double flip move for accelerating the Swendsen-Wang algorithm for Ising models with mixed boundary conditions below the critical temperature. The double flip move consists of a geometric flip of the spin lattice…
Potts spin systems play a fundamental role in statistical mechanics and quantum field theory, and can be studied within the spin, the Fortuin-Kasteleyn (FK) bond or the $q$-flow (loop) representation. We introduce a Loop-Cluster (LC) joint…
We consider a variety of nearest-neighbor spin models defined on the d-dimensional hypercubic lattice Z^d. Our essential assumption is that these models satisfy the condition of reflection positivity. We prove that whenever the associated…
We have performed a molecular dynamics computer simulation of a supercooled binary Lennard-Jones system in order to compare the dynamical behavior of this system with the predictions of the idealized version of mode-coupling theory (MCT).…
The dynamic behavior of cluster algorithms is analyzed in the classical mean field limit. Rigorous analytical results below $T_c$ establish that the dynamic exponent has the value $z_{sw}=1$ for the Swendsen-Wang algorithm and $z_{uw}=0$…
We consider the Potts model with $q$ colors on a sequence of weighted graphs with adjacency matrices $A_n$, allowing for both positive and negative weights. Under a mild regularity condition the mean-field prediction for the log partition…
The Curie-Weiss Potts model is a mean field version of the well-known Potts model. In this model, the critical line $\beta = \beta_c (h)$ is explicitly known and corresponds to a first order transition when $q > 2$. In the present paper we…
We consider the spherical model on a spider-web graph. This graph is effectively infinite-dimensional, similar to the Bethe lattice, but has loops. We show that these lead to non-trivial corrections to the simple mean-field behavior. We…
Using a single-site mean-field approximation (MFA) and Monte Carlo simulations, we examine Ising-like models on directed regular random graphs. The models are directed-network implementations of the Ising model, Ising model with absorbing…
This article studies the planar Potts model and its random-cluster representation. We show that the phase transition of the nearest-neighbor ferromagnetic $q$-state Potts model on $\mathbb Z^2$ is continuous for $q\in\{2,3,4\}$, in the…
Monte Carlo simulations of the 1D Ising model with ferromagnetic interactions decaying with distance $r$ as $1/r^{1+\sigma}$ are performed by applying the Swendsen-Wang cluster algorithm with cumulative probabilities. The critical behavior…
We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents $\nu$ and…
We consider the stochastic Ising model on sparse Erdos-Renyi graphs $G(n,d/n)$ with $d>1$ at the critical temperature $\beta_c=\tanh^{-1}(d^{-1})$ and prove that with high probability, the mixing time is at most polynomial in $n$. Our…
We propose a notion of contraction function for a family of graphs and establish its connection to the strong spatial mixing for spin systems. More specifically, we show that for anti-ferromagnetic Potts model on families of graphs…