Related papers: Cutoff for the Swendsen-Wang dynamics on the compl…
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…
We study convergence to equilibrium for a large class of Markov chains in random environment. The chains are sparse in the sense that in every row of the transition matrix $P$ the mass is essentially concentrated on few entries. Moreover,…
We consider the performance of Glauber dynamics for the random cluster model with real parameter $q>1$ and temperature $\beta>0$. Recent work by Helmuth, Jenssen and Perkins detailed the ordered/disordered transition of the model on random…
In this article, we derive a sharp mixing time estimate of the Glauber dynamics for the Curie-Weiss-Potts model in the low-temperature regime. In contrast to the high-temperature regime studied by Cuff et al. (J. Stat. Phys. 149: 432-477,…
The small noise cut-off phenomenon in continuous time and space has been studied in the recent literature for the linear and non-linear stable Langevin dynamics with additive L\'evy drivers - understood as abrupt thermalization of the…
We consider the Ising, and more generally, $q$-state Potts Glauber dynamics on random $d$-regular graphs on $n$ vertices at low temperatures $\beta \gtrsim \frac{\log d}{d}$. The mixing time is exponential in $n$ due to a bottleneck between…
The six-vertex model in statistical physics is a weighted generalization of the ice model on $\mathbb{Z}^2$ (i.e., Eulerian orientations) and the zero-temperature three-state Potts model (i.e., proper three-colorings). The phase diagram of…
We study the multi-component Ising model, which is also known as the block Ising model. In this model, the particles are partitioned into a fixed number of groups with a fixed proportion, and the interaction strength is determined by the…
We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at $q=2$ is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic…
Exponential random graph models have become increasingly important in the study of modern networks ranging from social networks, economic networks, to biological networks. They seek to capture a wide variety of common network tendencies…
The random-cluster model is a unifying framework for studying random graphs, spin systems in physics and random spanning trees. The model is closely related to, though much more general than the classical Ising and Potts models, but its…
The zero-temperature Glauber dynamics is used to investigate the persistence probability $P(t)$ in the Potts model with $Q=3,4,5,7,9,12,24,64, 128$, $256, 512, 1024,4096,16384 $,..., $2^{30}$ states on {\it directed} and {\it undirected}…
We investigate ordered phases (s-wave superconducting (SC), antiferromagnetic (AF) and charge ordered (CO) phases) of the half-filled Holstein-Hubbard model using the dynamical mean-field theory in combination with a continuous time quantum…
We present a mean-field theory for the dynamics of driven flow with exclusion in graphenelike structures, and numerically check its predictions. We treat first a specific combination of bond transmissivity rates, where mean field predicts,…
The cutoff phenomenon for an ergodic Markov chain describes a sharp transition in the convergence to its stationary distribution, over a negligible period of time, known as cutoff window. We study the cutoff phenomenon for simple random…
We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…
We study Swendsen--Wang dynamics for the critical $q$-state Potts model on the square lattice. For $q=2,3,4$, where the phase transition is continuous, the mixing time $t_{\textrm{mix}}$ is expected to obey a universal power-law independent…
We consider a dynamic random graph on $n$ vertices that is obtained by starting from a random graph generated according to the configuration model with a prescribed degree sequence and at each unit of time randomly rewiring a fraction…
We consider dynamical percolation on the complete graph $K_n$, where each edge refreshes its state at rate $\mu \ll 1/n$, and is then declared open with probability $p = \lambda/n$ where $\lambda > 1$. We study a random walk on this…
For general spin systems, we prove that a contractive coupling for any local Markov chain implies optimal bounds on the mixing time and the modified log-Sobolev constant for a large class of Markov chains including the Glauber dynamics,…