Sampling, counting, and large deviations for triangle-free graphs near the critical density
We study the following combinatorial counting and sampling problems: can we sample from
the Erdős-Rényi random graph G(n,p) conditioned on triangle-freeness? Can we …
the Erdős-Rényi random graph G(n,p) conditioned on triangle-freeness? Can we …
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 …
Sampling and counting triangle-free graphs near the critical density
We study the following combinatorial counting and sampling problems: can we efficiently
sample from the Erd\H {o} sR\'{e} nyi random graph $ G (n, p) $ conditioned on triangle …
sample from the Erd\H {o} sR\'{e} nyi random graph $ G (n, p) $ conditioned on triangle …
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 …
An information-geometric approach for network decomposition using the q-state Potts model
ALM Levada - arxiv preprint arxiv:2406.17144, 2024 - arxiv.org
Complex networks are critical in many scientific, technological, and societal contexts due to
their ability to represent and analyze intricate systems with interdependent components …
their ability to represent and analyze intricate systems with interdependent components …