Solving Unique Games over Globally Hypercontractive Graphs

by   Mitali Bafna, et al.

We study the complexity of affine Unique-Games (UG) over globally hypercontractive graphs, which are graphs that are not small set expanders but admit a useful and succinct characterization of all small sets that violate the small-set expansion property. This class of graphs includes the Johnson and Grassmann graphs, which have played a pivotal role in recent PCP constructions for UG, and their generalizations via high-dimensional expanders. Our algorithm shows how to round "low-entropy" solutions to sum-of-squares (SoS) semidefinite programs, broadly extending the algorithmic framework of [BBKSS'21]. We give a new rounding scheme for SoS, which eliminates global correlations in a given pseudodistribution so that it retains various good properties even after conditioning. Getting structural control over a pseudodistribution after conditioning is a fundamental challenge in many SoS based algorithms. Due to these challenges, [BBKSS] were not able to establish strong algorithms for globally hypercontractive graphs, and could only do so for certifiable small-set expanders. Our results improve upon the results of [BBKSS] in various aspects: we are able to deal with instances with arbitrarily small (but constant) completeness, and most importantly, their algorithm gets a soundness guarantee that degrades with other parameters of the graph (which in all PCP constructions grow with the alphabet size), whereas our doesn't. Our result suggests that UG is easy on globally hypercontractive graphs, and therefore highlights the importance of graphs that lack such a characterization in the context of PCP reductions for UG.


page 1

page 2

page 3

page 4


Playing Unique Games on Certified Small-Set Expanders

We give an algorithm for solving unique games (UG) instances whose const...

Strong Parallel Repetition for Unique Games on Small Set Expanders

Strong Parallel Repetition for Unique Games on Small Set Expanders The...

High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games

Higher order random walks (HD-walks) on high dimensional expanders have ...

Marginalization and Conditioning for LWF Chain Graphs

In this paper, we deal with the problem of marginalization over and cond...

Parity games and universal graphs

This paper is a contribution to the study of parity games and the recent...

Approximating Constraint Satisfaction Problems on High-Dimensional Expanders

We consider the problem of approximately solving constraint satisfaction...

Please sign up or login with your details

Forgot password? Click here to reset