Rank-1-perturbed trickledown theorems: Mixing time of Glauber dynamics for the Sherrington-Kirkpatrick model up to β≤ 12+
Mathews Boban, Anqi Li, Shayan Oveis Gharan
Abstract
We introduce a new family of trickledown theorems, a.k.a., local to global technique to bound the spectral gap of the Glauber dynamics for multi-state spin systems. In this technique instead of upper-bounding the influence matrix of a link of co-dimension 2 by λI (where λ is the second eigenvalue of the link), we upper-bound the influence matrix after a carefully chosen rank-1 shift. The rank-1 shift allows for a significantly smaller upper-bound but it comes at the cost of bounding the average loss due to rank-1 perturbations. As an application we use this method to show that the natural Glauber dynamics mixes in polynomial time to generate samples from the Sherrington-Kirkpatrick model for β≤ 12+, for an absolute constant >0. At the heart of the proof we manage to bound the loss due to rank-1 perturbations by averaging over all links of co-dimension 2.
Create a lesson
Related papers
Differential Privacy Meets Fixed Parameter Tractability: Algorithms and Lower Bounds
Pritish Kamath, Ravi Kumar, Pasin Manurangsi
Spatial Mixing and Deterministic Approximate Counting of Multi-spin Systems beyond Bounded Degree Graphs
Zhidan Li, Kuan Yang
Deterministic Edge-Fault-Tolerant Connectivity Labeling Schemes with Nearly Optimal Label Size
Yaowei Long, Seth Pettie, Thatchaphol Saranurak
Exponential Lower Bounds for Integer-Weighted Shortest-Paths Preservers of DAGs
Michael Yi Wang, Nicole Wein
A Tight Ω(m) Information-Theoretic Lower Bound for Randomized Online Set Cover
Ilan Doron-Arad, Joseph, Naor
A Non-constant Lower Bound for Grammar-Based Compression with Greedy
Danny Hucke