Metraipolis › archive › dc_281146870432

Low-Temperature Sampling via Equilibrium Disagreements — arXiv:2611.08416

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08416
License (as archived)
CC0-1.0
Archived
2026-11-06T14:52:26.139Z
SHA-256 of the archived text
3409be6118812d95c30d25c976390a71eeed435c390088e4c155275f67337757
Stable URL of this page
https://metraipolis.com/documento/dc_281146870432

How to cite

Low-Temperature Sampling via Equilibrium Disagreements — arXiv:2611.08416 — arXiv (en), https://arxiv.org/abs/2611.08416 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_281146870432 (Metraipolis archive dc_281146870432, sha256 3409be6118812d95c30d25c976390a71eeed435c390088e4c155275f67337757)
BibTeX
@misc{dc281146870432,
  title = {Low-Temperature Sampling via Equilibrium Disagreements — arXiv:2611.08416},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08416},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_281146870432; sha256 3409be6118812d95c30d25c976390a71eeed435c390088e4c155275f67337757},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08416. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We develop a new framework for sampling at low temperatures using Glauber dynamics. In this regime, the coexistence of competing modes (commonly referred to as phases) creates bottlenecks that can make worst-case mixing exponentially slow. The main new ingredient in our framework is to relate convergence within a phase to the geometry of disagreements between two independent configurations drawn from that phase. As applications of our approach, we consider three canonical models on random regular graphs that have been central to low-temperature sampling, and establish fast convergence from natural initialisations of Glauber dynamics for every fixed degree. We show: --- For the hard-core model on random bipartite $d$-regular graphs, Glauber dynamics initialised from either one-sided independent set mixes within the corresponding phase in $n^{3/2+o(1)}$ steps throughout the non-uniqueness regime $\lambda>\lambda_c(d)$. --- For the random-cluster model on random $d$-regular graphs, for every real $q>2$, Glauber dynamics initialised from the all-in edge set mixes within the ordered phase in $n^{3/2+o(1)}$ steps for all $\beta\geq \beta_c$. Similarly, Glauber dynamics initialised from the all-out edge set mixes within the disordered phase in $n^{3/2+o(1)}$ steps for $\beta\leq \beta_c$. --- For the ferromagnetic Ising model on random $d$-regular graphs, Glauber dynamics initialised from all-plus or all-minus mixes within the corresponding phase in $n^{3/2+o(1)}$ steps throughout the low-temperature regime $\beta>\beta_c(d)$. We also give an $n^{2+o(1)}$-time algorithm that combines phase samples into samples from the full distribution, avoiding in particular time-costly approximations of the corresponding partition functions to the target sampling accuracy.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Discrete Mathematics (cs.DM) ; Data Structures and Algorithms (cs.DS); Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.08416 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:23:57.629Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).