Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
For Δ≥ 5 and q large as a function of Δ, we give a detailed picture of the phase transition of
the random cluster model on random Δ-regular graphs. In particular, we determine the …
the random cluster model on random Δ-regular graphs. In particular, we determine the …
Metastability of the Potts ferromagnet on random regular graphs
We study the performance of Markov chains for the q-state ferromagnetic Potts model on
random regular graphs. While the cases of the grid and the complete graph are by now well …
random regular graphs. While the cases of the grid and the complete graph are by now well …
Mean-field Potts and random-cluster dynamics from high-entropy initializations
A common obstruction to efficient sampling from high-dimensional distributions with Markov
chains is the multimodality of the target distribution because they may get trapped far from …
chains is the multimodality of the target distribution because they may get trapped far from …
Entropy decay in the Swendsen–Wang dynamics on ℤd
We study the mixing time of the Swendsen-Wang dynamics for the ferromagnetic Ising and
Potts models on the integer lattice ℤ d. This dynamics is a widely used Markov chain that …
Potts models on the integer lattice ℤ d. This dynamics is a widely used Markov chain that …
Sampling from the Potts model at low temperatures via Swendsen–Wang dynamics
A Blanca, R Gheissari - 2023 IEEE 64th Annual Symposium on …, 2023 - ieeexplore.ieee.org
Sampling from the q-state ferromagnetic Potts model is a fundamental question in statistical
physics, probability theory, and theoretical computer science. On general graphs, this …
physics, probability theory, and theoretical computer science. On general graphs, this …
Swendsen‐Wang algorithm on the mean‐field Potts model
A Galanis, D Štefankovič… - Random Structures & …, 2019 - Wiley Online Library
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 …
the mean‐field (Curie‐Weiss) model. We analyze the Swendsen‐Wang algorithm which is a …
[HTML][HTML] Tunneling behavior of Ising and Potts models in the low-temperature regime
FR Nardi, A Zocca - Stochastic Processes and their Applications, 2019 - Elsevier
We consider the ferromagnetic q-state Potts model with zero external field in a finite volume
and assume that its stochastic evolution is described by a Glauber-type dynamics …
and assume that its stochastic evolution is described by a Glauber-type dynamics …
Sampling algorithms for discrete Markov random fields and related graphical models
AJ Izenman - Journal of the American Statistical Association, 2021 - Taylor & Francis
Discrete Markov random fields are undirected graphical models in which the nodes of a
graph are discrete random variables with values usually represented by colors. Typically …
graph are discrete random variables with values usually represented by colors. Typically …
Random-cluster dynamics on random regular graphs in tree uniqueness
A Blanca, R Gheissari - Communications in Mathematical Physics, 2021 - Springer
We establish rapid mixing of the random-cluster Glauber dynamics on random\varDelta Δ-
regular graphs for all q ≥ 1 q≥ 1 and p< p_u (q,\varDelta) p< pu (q, Δ), where the threshold …
regular graphs for all q ≥ 1 q≥ 1 and p< p_u (q,\varDelta) p< pu (q, Δ), where the threshold …
The critical mean-field Chayes–Machta dynamics
The random-cluster model is a unifying framework for studying random graphs, spin systems
and electrical networks that plays a fundamental role in designing efficient Markov Chain …
and electrical networks that plays a fundamental role in designing efficient Markov Chain …