### Fotios Iliopoulos

###
EECS Department

University of California, Berkeley

Technical Report No. UCB/EECS-2019-125

August 16, 2019

### http://www2.eecs.berkeley.edu/Pubs/TechRpts/2019/EECS-2019-125.pdf

This thesis studies randomized local search algorithms for finding solutions of constraint satisfaction problems inspired by and extending the Lovasz Local Lemma (LLL).

The LLL is a powerful probabilistic tool for establishing the existence of objects satisfying certain properties (constraints). As a probability statement it asserts that, given a family of “bad” events, if each bad event is individually not very likely and independent of all but a small number of other bad events, then the probability of avoiding all bad events is strictly positive. In a celebrated breakthrough, Moser and Tardos made the LLL constructive for any product probability measure over explicitly presented variables. Specifically, they proved that whenever the LLL condition holds, their Resample algorithm, which repeatedly selects any occurring bad event and resamples all its variables according to the measure, quickly converges to an object with desired properties.

In this dissertation we present a framework that extends the work of Moser and Tardos and can be used to analyze arbitrary, possibly complex, focused local search algorithms, i.e., search algorithms whose process for addressing violated constraints, while local, is more sophisticated than obliviously resampling their variables independently of the current configuration. We give several applications of this framework, notably a new vertex coloring algorithm for graphs with sparse vertex neighborhoods that uses a number of colors that matches the algorithmic barrier for random graphs, and polynomial time algorithms for the celebrated (non-constructive) results of Kahn for the Goldberg-Seymour and List-Edge-Coloring Conjectures.

Finally, we introduce a generalization of Kolmogorov’s notion of commutative algorithms, cast as matrix commutativity, and show that their output distribution approximates the so-called “LLL-distribution”, i.e., the distribution obtained by conditioning on avoiding all bad events. This fact allows us to consider questions such as the number of possible distinct final states and the probability that certain portions of the state space are visited by a local search algorithm, extending existing results for the Moser-Tardos algorithm to commutative algorithms.

**Advisor:** Alistair Sinclair

BibTeX citation:

@phdthesis{Iliopoulos:EECS-2019-125, Author = {Iliopoulos, Fotios}, Title = {Stochastic Local Search and the Lovasz Local Lemma}, School = {EECS Department, University of California, Berkeley}, Year = {2019}, Month = {Aug}, URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2019/EECS-2019-125.html}, Number = {UCB/EECS-2019-125}, Abstract = {This thesis studies randomized local search algorithms for finding solutions of constraint satisfaction problems inspired by and extending the Lovasz Local Lemma (LLL). The LLL is a powerful probabilistic tool for establishing the existence of objects satisfying certain properties (constraints). As a probability statement it asserts that, given a family of “bad” events, if each bad event is individually not very likely and independent of all but a small number of other bad events, then the probability of avoiding all bad events is strictly positive. In a celebrated breakthrough, Moser and Tardos made the LLL constructive for any product probability measure over explicitly presented variables. Specifically, they proved that whenever the LLL condition holds, their Resample algorithm, which repeatedly selects any occurring bad event and resamples all its variables according to the measure, quickly converges to an object with desired properties. In this dissertation we present a framework that extends the work of Moser and Tardos and can be used to analyze arbitrary, possibly complex, focused local search algorithms, i.e., search algorithms whose process for addressing violated constraints, while local, is more sophisticated than obliviously resampling their variables independently of the current configuration. We give several applications of this framework, notably a new vertex coloring algorithm for graphs with sparse vertex neighborhoods that uses a number of colors that matches the algorithmic barrier for random graphs, and polynomial time algorithms for the celebrated (non-constructive) results of Kahn for the Goldberg-Seymour and List-Edge-Coloring Conjectures. Finally, we introduce a generalization of Kolmogorov’s notion of commutative algorithms, cast as matrix commutativity, and show that their output distribution approximates the so-called “LLL-distribution”, i.e., the distribution obtained by conditioning on avoiding all bad events. This fact allows us to consider questions such as the number of possible distinct final states and the probability that certain portions of the state space are visited by a local search algorithm, extending existing results for the Moser-Tardos algorithm to commutative algorithms.} }

EndNote citation:

%0 Thesis %A Iliopoulos, Fotios %T Stochastic Local Search and the Lovasz Local Lemma %I EECS Department, University of California, Berkeley %D 2019 %8 August 16 %@ UCB/EECS-2019-125 %U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2019/EECS-2019-125.html %F Iliopoulos:EECS-2019-125