Fast mixing via polymers for random graphs with unbounded degree
Andreas Galanis, Leslie Ann Goldberg, James Stewart

TL;DR
This paper introduces a new polymer model framework that relaxes the bounded-degree assumption, enabling efficient approximation algorithms for spin systems on more general graphs, including those with unbounded degrees.
Contribution
The authors develop a less restrictive polymer model framework based on the edge perspective, allowing analysis on graphs with unbounded degrees.
Findings
Applicable to random graphs with unbounded degrees from fixed degree sequences.
Provides approximation algorithms for the ferromagnetic Potts model.
Extends to more general spin systems.
Abstract
The polymer model framework is a classical tool from statistical mechanics that has recently been used to obtain approximation algorithms for spin systems on classes of bounded-degree graphs; examples include the ferromagnetic Potts model on expanders and on the grid. One of the key ingredients in the analysis of polymer models is controlling the growth rate of the number of polymers, which has been typically achieved so far by invoking the bounded-degree assumption. Nevertheless, this assumption is often restrictive and obstructs the applicability of the method to more general graphs. For example, sparse random graphs typically have bounded average degree and good expansion properties, but they include vertices with unbounded degree, and therefore are excluded from the current polymer-model framework. We develop a less restrictive framework for polymer models that relaxes the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
