88 citations · 293 across the 27 of their papers we have counts for
6 papers · 1 filter
Efficiently list-edge coloring multigraphs asymptotically optimally
Fotis Iliopoulos, Alistair Sinclair
We give polynomial time algorithms for the seminal results of Kahn, who showed that the Goldberg-Seymour and List-Coloring conjectures for (list-)edge coloring multigraphs hold asy…
Beyond the Lovasz Local Lemma: Point to Set Correlations and Their Algorithmic Applications
Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair
Following the groundbreaking algorithm of Moser and Tardos for the Lovasz Local Lemma (LLL), there has been a plethora of results analyzing local search algorithms for various cons…
Spatial Mixing and Non-local Markov chains
Antonio Blanca, Pietro Caputo, Alistair Sinclair +1
We consider spin systems with nearest-neighbor interactions on an -vertex -dimensional cube of the integer lattice graph . We study the effects that exponential…
Spatial Mixing and Systematic Scan Markov chains
Antonio Blanca, Pietro Caputo, Alistair Sinclair +1
We consider spin systems on the integer lattice graph with nearest-neighbor interactions. We develop a combinatorial framework for establishing that exponential deca…
Random-Cluster Dynamics in
Antonio Blanca, Alistair Sinclair
The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and electrical networks, but its dynamics have so far largely resisted anal…
Spatial mixing and approximation algorithms for graphs with bounded connective constant
Alistair Sinclair, Piyush Srivastava, Yitong Yin
The hard core model in statistical physics is a probability distribution on independent sets in a graph in which the weight of any independent set I is proportional to lambda^(|I|)…