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 …
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 …
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
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 …
parameter $ q> 1$ and temperature $\beta> 0$. Recent work by Helmuth, Jenssen and …
Mean-field Potts and random-cluster dynamics from high-entropy initializations
A common obstruction to efficient sampling from high-dimensional distributions is the
multimodality of the target distribution because Markov chains may get trapped far from …
multimodality of the target distribution because Markov chains may get trapped far from …
Random cluster model on regular graphs
For a graph G=(V, E) with v (G) vertices the partition function of the random cluster model is
defined by ZG (q, w)=∑ A⊆ E (G) qk (A) w| A|, where k (A) denotes the number of connected …
defined by ZG (q, w)=∑ A⊆ E (G) qk (A) w| A|, where k (A) denotes the number of connected …
On the tractability of sampling from the Potts model at low temperatures via random-cluster dynamics
A Blanca, R Gheissari - Probability Theory and Related Fields, 2024 - Springer
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 …
On the tractability of sampling from the Potts model at low temperatures via Swendsen--Wang dynamics
A Blanca, R Gheissari - arXiv preprint arXiv:2304.03182, 2023 - arxiv.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 …
statistical physics, probability theory, and theoretical computer science. On general graphs …
Spectral Independence a New Tool to Analyze Markov Chains
K Liu - 2023 - search.proquest.com
We introduce a versatile technique called spectral independence for the analysis of Markov
chain Monte Carlo algorithms in high-dimensional probability and statistics. We rigorously …
chain Monte Carlo algorithms in high-dimensional probability and statistics. We rigorously …
A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs
We give a randomized algorithm that approximates the number of independent sets in a
dense, regular bipartite graph-in the language of approximate counting, we give an FPRAS …
dense, regular bipartite graph-in the language of approximate counting, we give an FPRAS …
Approximately counting independent sets in dense bipartite graphs via subspace enumeration
We give a randomized algorithm that approximates the number of independent sets in a
dense, regular bipartite graph--in the language of approximate counting, we give an FPRAS …
dense, regular bipartite graph--in the language of approximate counting, we give an FPRAS …