Computing the Independence Polynomial: from the Tree Threshold Down to the Roots
|
|
- Ross Marsh
- 5 years ago
- Views:
Transcription
1 1 / 16 Computing the Independence Polynomial: from the Tree Threshold Down to the Roots Nick Harvey 1 Piyush Srivastava 2 Jan Vondrák 3 1 UBC 2 Tata Institute 3 Stanford SODA 2018
2 The Lovász Local Lemma 2 / 16 Theorem (Symmetric form, Erdős-Lovász 75) If E 1, E 2,... are events on a probability space Ω such that Each event is independent of all but d other events 1 The probability of each event is at most e(d+1) then [ ] Pr E i > 0 (but typically exponentially small) i
3 Example: 2-colorability of hypergraphs 3 / 16 Given: a system of sets, each of size k, and each intersecting at most d := 1 2e 2k sets. Goal: color the elements red/blue so that every set contains both colors.
4 Example: 2-colorability of hypergraphs 3 / 16 Given: a system of sets, each of size k, and each intersecting at most d := 1 2e 2k sets. Goal: color the elements red/blue so that every set contains both colors. Randomized coloring: Color elements independently red/blue.
5 Example: 2-colorability of hypergraphs 3 / 16 Given: a system of sets, each of size k, and each intersecting at most d := 1 2e 2k sets. Goal: color the elements red/blue so that every set contains both colors. Randomized coloring: Color elements independently red/blue. LLL analysis: For set A i, event E i occurs if A i is all-red or all-blue. Each event E i is independent of all E j where A i A j =. Parameter d chosen s.t. LLL Pr[no set is monochromatic] > 0
6 4 / 16 History of the Algorithmic LLL Many attempts to make the LLL algorithmic: Some applications algorithmic, with weaker parameters [Beck 91], [Alon 91], [Molloy-Reed 98], [Czumaj-Scheideler 00], [Srinivasan 08]...
7 4 / 16 History of the Algorithmic LLL Many attempts to make the LLL algorithmic: Some applications algorithmic, with weaker parameters [Beck 91], [Alon 91], [Molloy-Reed 98], [Czumaj-Scheideler 00], [Srinivasan 08]... Moser s Algorithm [2008]: As long as there is a monochromatic set, pick an arbitrary one and re-color it randomly.
8 4 / 16 History of the Algorithmic LLL Many attempts to make the LLL algorithmic: Some applications algorithmic, with weaker parameters [Beck 91], [Alon 91], [Molloy-Reed 98], [Czumaj-Scheideler 00], [Srinivasan 08]... Moser s Algorithm [2008]: As long as there is a monochromatic set, pick an arbitrary one and re-color it randomly.
9 4 / 16 History of the Algorithmic LLL Many attempts to make the LLL algorithmic: Some applications algorithmic, with weaker parameters [Beck 91], [Alon 91], [Molloy-Reed 98], [Czumaj-Scheideler 00], [Srinivasan 08]... Moser s Algorithm [2008]: As long as there is a monochromatic set, pick an arbitrary one and re-color it randomly.
10 4 / 16 History of the Algorithmic LLL Many attempts to make the LLL algorithmic: Some applications algorithmic, with weaker parameters [Beck 91], [Alon 91], [Molloy-Reed 98], [Czumaj-Scheideler 00], [Srinivasan 08]... Moser s Algorithm [2008]: As long as there is a monochromatic set, pick an arbitrary one and re-color it randomly. Theorem: [Moser-Tardos 08] If each set intersects at most 2 k /2e others, this algorithm terminates in expected polynomial time.
11 Algorithm dynamics 5 / 16 Previous LLL algorithms: resampling infeasible solutions Space {0, 1} m of colorings Feasible region: good colorings Algorithm randomly generates integral points until feasible.
12 Algorithm dynamics 5 / 16 Previous LLL algorithms: resampling infeasible solutions Space {0, 1} m of colorings Feasible region: good colorings Algorithm randomly generates integral points until feasible.
13 Algorithm dynamics 5 / 16 Previous LLL algorithms: resampling infeasible solutions Space {0, 1} m of colorings Feasible region: good colorings Algorithm randomly generates integral points until feasible.
14 Algorithm dynamics 5 / 16 Previous LLL algorithms: resampling infeasible solutions Space {0, 1} m of colorings Feasible region: good colorings Algorithm randomly generates integral points until feasible.
15 Algorithm dynamics 5 / 16 Previous LLL algorithms: resampling infeasible solutions Space {0, 1} m of colorings Feasible region: good colorings Algorithm randomly generates integral points until feasible.
16 Algorithm dynamics 5 / 16 Our LLL algorithm: rounding feasible solution Space {0, 1} m of colorings Feasible region: good colorings Starts with feasible, fractional coloring
17 Algorithm dynamics 5 / 16 Our LLL algorithm: rounding feasible solution Space {0, 1} m of colorings Feasible region: good colorings Starts with feasible, fractional coloring Algorithm rounds each coordinate to integrality, maintaining feasibility.
18 Algorithm dynamics 5 / 16 Our LLL algorithm: rounding feasible solution Space {0, 1} m of colorings Feasible region: good colorings Starts with feasible, fractional coloring Algorithm rounds each coordinate to integrality, maintaining feasibility.
19 Algorithm dynamics 5 / 16 Our LLL algorithm: rounding feasible solution Space {0, 1} m of colorings Feasible region: good colorings Starts with feasible, fractional coloring Algorithm rounds each coordinate to integrality, maintaining feasibility.
20 Algorithm dynamics 5 / 16 Our LLL algorithm: rounding feasible solution Space {0, 1} m of colorings Feasible region: good colorings Starts with feasible, fractional coloring Algorithm rounds each coordinate to integrality, maintaining feasibility. What is this feasible region?
21 The Feasible Region 6 / 16 Dependency Graph G: Vertex v in G bad event E v set A v. Edges in G dependent events sets that intersect. Maximum degree of G d (amount of dependence).
22 The Feasible Region 6 / 16 Dependency Graph G: Vertex v in G bad event E v set A v. Edges in G dependent events sets that intersect. Maximum degree of G d (amount of dependence). Observation: The sets containing a particular element form a clique in G.
23 The Feasible Region 6 / 16 Dependency Graph G: Vertex v in G bad event E v set A v. Edges in G dependent events sets that intersect. Maximum degree of G d (amount of dependence). Observation: The sets containing a particular element form a clique in G. Independence Polynomial: q(p) = ( p v ), indep. I where p v [0, 1] are per-vertex parameters. v I
24 The Feasible Region 6 / 16 Dependency Graph G: Vertex v in G bad event E v set A v. Edges in G dependent events sets that intersect. Maximum degree of G d (amount of dependence). Observation: The sets containing a particular element form a clique in G. Independence Polynomial: q(p) = ( p v ), indep. I where p v [0, 1] are per-vertex parameters. The Feasible Region for the LLL: The Shearer region { } S = p [0, 1] V : q(p ) > 0 0 p p. v I
25 The Feasible Region 7 / 16 Independence Polynomial: q(p) = Shearer region: S = ( p v ), p v [0, 1] V indep. I v I { } p [0, 1] V : q(p ) > 0 0 p p Theorem (Shearer 85) Let E 1, E 2,... be events with p i = Pr[E i ]. Let G be a graph s.t. each event is independent of its non-neighbors in G p S. Then Pr[ i E i] q(p) > 0. False for all p S.
26 A Simple Case: The Univariate Feasible Region 8 / 16 Independence Polynomial: q(p) = ( p v ), p v [0, 1] V indep. I v I { } Shearer region: S = p [0, 1] V : q(p ) > 0 0 p p Closest root to origin for G: Let λ G = min { z : q(z1) = 0 }. 0 no roots λ G R
27 A Simple Case: The Univariate Feasible Region 8 / 16 Independence Polynomial: q(p) = ( p v ), p v [0, 1] V indep. I v I { } Shearer region: S = p [0, 1] V : q(p ) > 0 0 p p Closest root to origin for G: Let λ G = min { z : q(z1) = 0 }. Shearer s lemma: If all p i λ G then p S, so Pr[ i E i] > 0. 0 Pr[ i E i] > 0 Pr[ i E i] = 0 (in some Ω) no roots λ G R
28 A Simple Case: The Univariate Feasible Region Independence Polynomial: q(p) = ( p v ), p v [0, 1] V indep. I v I { } Shearer region: S = p [0, 1] V : q(p ) > 0 0 p p Closest root to origin for G: Let λ G = min { z : q(z1) = 0 }. Shearer s lemma: If all p i λ G then p S, so Pr[ i E i] > 0. 0 Pr[ i E i] > 0 Pr[ i E i] = 0 (in some Ω) no roots (in any max-degree d graph) λ d 1 ed λ G R Closest root to origin for degree d graphs: Let λ d := inf G λ G over all graphs of maximum degree d. Then λ d = (d 1)d 1 d d 1 ed. 8 / 16
29 A rounding approach to LLL (for hypergraph coloring) 1: procedure LLLBYROUNDING 2: Initial fractional coloring: each element 1 2 red and 1 2 blue 3: for i 1,..., m do 4: Color element i red or blue, whichever preserves feasibility in S 5: return integer coloring Required to prove: For existential LLL: coloring element either red or blue preserves feasibility in S For algorithmic LLL: can efficiently decide feasibility for S 9 / 16
30 A rounding approach to LLL (for hypergraph coloring) 1: procedure LLLBYROUNDING 2: Initial fractional coloring: each element 1 2 red and 1 2 blue 3: for i 1,..., m do 4: Color element i red or blue, whichever preserves feasibility in S 5: return integer coloring Required to prove: For existential LLL: coloring element either red or blue preserves feasibility in S For algorithmic LLL: can efficiently decide feasibility for S 9 / 16
31 Preserving feasibility: a proof of existential LLL 10 / 16 Recall that q(p) = ( p v ) indep. I v I { } S = p [0, 1] V : q(p ) > 0 0 p p
32 Preserving feasibility: a proof of existential LLL 10 / 16 Recall that q(p) = indep. I ( p v ) v I { } S = p [0, 1] V : q(p ) > 0 0 p p { } A cheat! S = p [0, 1] V : q(p) > 0.
33 11 / 16 Preserving feasibility: a proof of existential LLL Recall that q(p) = S = p v indep. I ( p v ) v I { } p [0, 1] V : q(p) > 0 = Pr[set A v is monochromatic] (with cheating)
34 11 / 16 Preserving feasibility: a proof of existential LLL Recall that q(p) = S = indep. I ( p v ) v I { } p [0, 1] V : q(p) > 0 (with cheating) p v = Pr[set A v is monochromatic] Let x u = Pr[element u is red]. Then p v = x u + (1 x u ). u set A }{{ v u set A }} v {{} Pr[A v all red] Pr[A v all blue]
35 11 / 16 Preserving feasibility: a proof of existential LLL Recall that q(p) = S = indep. I ( p v ) v I { } p [0, 1] V : q(p) > 0 (with cheating) p v = Pr[set A v is monochromatic] Let x u = Pr[element u is red]. Then p v = x u + (1 x u ). u set A v u set A }{{ v } multilinear in x
36 11 / 16 Preserving feasibility: a proof of existential LLL Recall that q(p) = S = indep. I ( p v ) v I { } p [0, 1] V : q(p) > 0 (with cheating) p v = Pr[set A v is monochromatic] Let x u = Pr[element u is red]. Then p v = x u + (1 x u ). u set A v u set A }{{ v } multilinear in x Recall: the sets containing element u form a clique. = the vertices { v : p v depends on x u } form a clique.
37 11 / 16 Preserving feasibility: a proof of existential LLL Recall that q(p) = S = indep. I ( p v ) v I { } p [0, 1] V : q(p) > 0 (with cheating) p v = Pr[set A v is monochromatic] Let x u = Pr[element u is red]. Then p v = x u + (1 x u ). u set A v u set A }{{ v } multilinear in x Recall: the sets containing element u form a clique. = the vertices { v : p v depends on x u } form a clique. Easy Fact: ind set clique 1. So each monomial v I ( p v) in q is multilinear in x.
38 11 / 16 Preserving feasibility: a proof of existential LLL Recall that q(p) = S = indep. I ( p v ) v I { } p [0, 1] V : q(p) > 0 (with cheating) p v = Pr[set A v is monochromatic] Let x u = Pr[element u is red]. Then p v = x u + (1 x u ). u set A v u set A }{{ v } multilinear in x Recall: the sets containing element u form a clique. = the vertices { v : p v depends on x u } form a clique. Easy Fact: ind set clique 1. So each monomial v I ( p v) in q is multilinear in x. Rounding: Either x u 0 or x u 1 will increase q(p), and preserve feasibility.
39 11 / 16 Preserving feasibility: a proof of existential LLL Recall that q(p) = S = indep. I ( p v ) v I { } p [0, 1] V : q(p) > 0 (with cheating) p v = Pr[set A v is monochromatic] Let x u = Pr[element u is red]. Then p v = x u + (1 x u ). u set A v u set A }{{ v } multilinear in x Recall: the sets containing element u form a clique. = the vertices { v : p v depends on x u } form a clique. Easy Fact: ind set clique 1. So each monomial v I ( p v) in q is multilinear in x. Rounding: Either x u 0 or x u 1 will increase q(p), and preserve feasibility. Conclusion: Final coloring x is integral, and p S, so p = 0 (e.g., by Shearer s lemma).
40 A rounding approach to LLL 1: procedure LLLBYROUNDING 2: Initial fractional coloring: each element 1 2 red and 1 2 blue 3: for i 1,..., m do 4: Color element i red or blue, whichever preserves feasibility in S 5: return integer coloring Required to prove: For existential LLL: coloring element either red or blue preserves feasibility in S For algorithmic LLL: can efficiently decide feasibility for S 12 / 16
41 A rounding approach to LLL 1: procedure LLLBYROUNDING 2: Initial fractional coloring: each element 1 2 red and 1 2 blue 3: for i 1,..., m do 4: Color element i red or blue, whichever preserves feasibility in S 5: return integer coloring Required to prove: For existential LLL: coloring element either red or blue preserves feasibility in S For algorithmic LLL: can efficiently decide feasibility for S 12 / 16
42 Main algorithmic results 13 / 16 Let G have n = V and maximum degree d. Let α (0, 1). Theorem (The FPTAS) Suppose that (1 + α)p S. There is a deterministic algorithm ( n giving a (1 + ɛ) approximation to q(p) in time ɛα ) O(log(d)/ α). Theorem (Subexponential LLL) Suppose there are m variables and event probabilities p satisfy (1 + α)p S. There is a deterministic algorithm constructing a point in ( n nm ) O( m/α log d). i=1 E i in time α
43 14 / 16 Hard core model and counting weighted independent sets Define univariate partition function Z (p) = p I = q( p1), for p C. indep. I I [Weitz 04] [Sly 10] λ d e d FPTAS NP-hard R
44 14 / 16 Hard core model and counting weighted independent sets Define univariate partition function Z (p) = p I = q( p1), for p C. Recall: λ G = min { p : Z (p) = 0 }. indep. I λ d := inf G λ G over all graphs of maximum degree d. I [Our work] [Galanis et al. 17] [Weitz 04] [Sly 10] λ G λ λ d λ d G λ d 1 e ed d NP-hard FPTAS FPTAS NP-hard R
45 14 / 16 Hard core model and counting weighted independent sets Define univariate partition function Z (p) = p I = q( p1), for p C. Recall: λ G = min { p : Z (p) = 0 }. indep. I λ d := inf G λ G over all graphs of maximum degree d. I [Our work] [Galanis et al. 17] [Weitz 04] [Sly 10] λ G λ λ d λ d G λ d 1 e ed d NP-hard FPTAS FPTAS NP-hard R Weitz s technique: correlation decay. Our work is a multivariate, complex generalization.
46 Conclusions 15 / 16 Polynomial techniques yield a (subexponential) algorithm for the LLL. Another example where non-constructive proofs relate to stability of polynomials. Continuing phenomenon: threshold of computational hardness is boundary of zero-free region.
47 15 / 16 Conclusions Polynomial techniques yield a (subexponential) algorithm for the LLL. Another example where non-constructive proofs relate to stability of polynomials. Continuing phenomenon: threshold of computational hardness is boundary of zero-free region. Questions: FPTAS is polytime but LLL algorithm is subexponential. Improve this? Is there an FPTAS with runtime O(n/αɛ) log d? Maybe using MCMC methods?
48 Main algorithmic results 16 / 16 Let G have n = V and maximum degree d. Let α (0, 1). Theorem (Subexponential LLL) Suppose there are m variables and event probabilities p satisfy (1 + α)p S. There is a deterministic algorithm constructing a point in ( n nm ) O( m/α log d). i=1 E i in time α Previous randomized algorithms run in time poly(n/α). [Kolipaka-Szegedy 11] Deterministic algorithms with much stronger hypotheses run in time poly(n). [Chandrasekaran-Goyal-Haeupler 13]
The Lovász Local Lemma: constructive aspects, stronger variants and the hard core model
The Lovász Local Lemma: constructive aspects, stronger variants and the hard core model Jan Vondrák 1 1 Dept. of Mathematics Stanford University joint work with Nick Harvey (UBC) The Lovász Local Lemma
More informationAn extension of the Moser-Tardos algorithmic local lemma
An extension of the Moser-Tardos algorithmic local lemma Wesley Pegden January 26, 2013 Abstract A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics
More informationarxiv: v2 [cs.ds] 11 Nov 2017
Computing the Independence Polynomial: from the Tree Threshold down to the Roots Nicholas J. A. Harvey Piyush Srivastava Jan Vondrák arxiv:1608.02282v2 [cs.ds] 11 Nov 2017 Abstract We study an algorithm
More informationGlobal Optima from Local Algorithms
Global Optima from Local Algorithms Dimitris Achlioptas 1 Fotis Iliopoulos 2 1 UC Santa Cruz 2 UC Berkeley Dimitris Achlioptas (UC Santa Cruz) Global Optima from Local Algorithms IMA Graphical Models 2015
More informationAn Algorithmic Proof of the Lopsided Lovász Local Lemma (simplified and condensed into lecture notes)
An Algorithmic Proof of the Lopsided Lovász Local Lemma (simplified and condensed into lecture notes) Nicholas J. A. Harvey University of British Columbia Vancouver, Canada nickhar@cs.ubc.ca Jan Vondrák
More informationThe Lovász Local Lemma : A constructive proof
The Lovász Local Lemma : A constructive proof Andrew Li 19 May 2016 Abstract The Lovász Local Lemma is a tool used to non-constructively prove existence of combinatorial objects meeting a certain conditions.
More informationLecture 17: D-Stable Polynomials and Lee-Yang Theorems
Counting and Sampling Fall 2017 Lecture 17: D-Stable Polynomials and Lee-Yang Theorems Lecturer: Shayan Oveis Gharan November 29th Disclaimer: These notes have not been subjected to the usual scrutiny
More informationLecture: New Constructive Aspects of the Lovász Local Lemma, and their Applications June 15, 2011
Approximation Algorithms Workshop June 13-17, 2011, Princeton Lecture: New Constructive Aspects of the Lovász Local Lemma, and their Applications June 15, 2011 Aravind Srinivasan Scribe: Ioana Bercea 1
More informationDeterministic Algorithms for the Lovász Local Lemma
Deterministic Algorithms for the Lovász Local Lemma The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher
More informationThe Ising Partition Function: Zeros and Deterministic Approximation
The Ising Partition Function: Zeros and Deterministic Approximation Jingcheng Liu Alistair Sinclair Piyush Srivastava University of California, Berkeley Summer 2017 Jingcheng Liu (UC Berkeley) The Ising
More informationLecture 10 Algorithmic version of the local lemma
Lecture 10 Algorithmic version of the local lemma Uriel Feige Department of Computer Science and Applied Mathematics The Weizman Institute Rehovot 76100, Israel uriel.feige@weizmann.ac.il June 9, 2014
More informationLecture 11: Generalized Lovász Local Lemma. Lovász Local Lemma
Lecture 11: Generalized Recall We design an experiment with independent random variables X 1,..., X m We define bad events A 1,..., A n where) the bad event A i depends on the variables (X k1,..., X kni
More informationLecture 24: April 12
CS271 Randomness & Computation Spring 2018 Instructor: Alistair Sinclair Lecture 24: April 12 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationProbabilistic Methods in Combinatorics Lecture 6
Probabilistic Methods in Combinatorics Lecture 6 Linyuan Lu University of South Carolina Mathematical Sciences Center at Tsinghua University November 16, 2011 December 30, 2011 Balance graphs H has v vertices
More informationApplications of the Lopsided Lovász Local Lemma Regarding Hypergraphs
Regarding Hypergraphs Ph.D. Dissertation Defense April 15, 2013 Overview The Local Lemmata 2-Coloring Hypergraphs with the Original Local Lemma Counting Derangements with the Lopsided Local Lemma Lopsided
More informationLecture 5. Shearer s Lemma
Stanford University Spring 2016 Math 233: Non-constructive methods in combinatorics Instructor: Jan Vondrák Lecture date: April 6, 2016 Scribe: László Miklós Lovász Lecture 5. Shearer s Lemma 5.1 Introduction
More informationAdvanced Algorithms 南京大学 尹一通
Advanced Algorithms 南京大学 尹一通 Constraint Satisfaction Problem variables: (CSP) X = {x 1, x2,..., xn} each variable ranges over a finite domain Ω an assignment σ ΩX assigns each variable a value in Ω constraints:
More informationDecay of Correlation in Spin Systems
(An algorithmic perspective to the) Decay of Correlation in Spin Systems Yitong Yin Nanjing University Decay of Correlation hardcore model: random independent set I v Pr[v 2 I ] (d+)-regular tree `! σ:
More informationABSTRACT THE LOVÁSZ LOCAL LEMMA. Dissertation directed by: Professor Aravind Srinivasan, Department of Computer Science
ABSTRACT Title of Dissertation ALGORITHMS AND GENERALIZATIONS FOR THE LOVÁSZ LOCAL LEMMA David G. Harris, Doctor of Philosophy, 2015 Dissertation directed by: Professor Aravind Srinivasan, Department of
More informationAn asymptotically tight bound on the adaptable chromatic number
An asymptotically tight bound on the adaptable chromatic number Michael Molloy and Giovanna Thron University of Toronto Department of Computer Science 0 King s College Road Toronto, ON, Canada, M5S 3G
More informationCS5314 Randomized Algorithms. Lecture 18: Probabilistic Method (De-randomization, Sample-and-Modify)
CS5314 Randomized Algorithms Lecture 18: Probabilistic Method (De-randomization, Sample-and-Modify) 1 Introduce two topics: De-randomize by conditional expectation provides a deterministic way to construct
More informationThe Probabilistic Method
The Probabilistic Method In Graph Theory Ehssan Khanmohammadi Department of Mathematics The Pennsylvania State University February 25, 2010 What do we mean by the probabilistic method? Why use this method?
More informationSubmodular Functions and Their Applications
Submodular Functions and Their Applications Jan Vondrák IBM Almaden Research Center San Jose, CA SIAM Discrete Math conference, Minneapolis, MN June 204 Jan Vondrák (IBM Almaden) Submodular Functions and
More informationLecture Notes CS:5360 Randomized Algorithms Lecture 20 and 21: Nov 6th and 8th, 2018 Scribe: Qianhang Sun
1 Probabilistic Method Lecture Notes CS:5360 Randomized Algorithms Lecture 20 and 21: Nov 6th and 8th, 2018 Scribe: Qianhang Sun Turning the MaxCut proof into an algorithm. { Las Vegas Algorithm Algorithm
More informationDynamic Programming on Trees. Example: Independent Set on T = (V, E) rooted at r V.
Dynamic Programming on Trees Example: Independent Set on T = (V, E) rooted at r V. For v V let T v denote the subtree rooted at v. Let f + (v) be the size of a maximum independent set for T v that contains
More informationCS6999 Probabilistic Methods in Integer Programming Randomized Rounding Andrew D. Smith April 2003
CS6999 Probabilistic Methods in Integer Programming Randomized Rounding April 2003 Overview 2 Background Randomized Rounding Handling Feasibility Derandomization Advanced Techniques Integer Programming
More informationThe Lopsided Lovász Local Lemma
Joint work with Linyuan Lu and László Székely Georgia Southern University April 27, 2013 The lopsided Lovász local lemma can establish the existence of objects satisfying several weakly correlated conditions
More informationLecture 19: Interactive Proofs and the PCP Theorem
Lecture 19: Interactive Proofs and the PCP Theorem Valentine Kabanets November 29, 2016 1 Interactive Proofs In this model, we have an all-powerful Prover (with unlimited computational prover) and a polytime
More informationOn preparing ground states of gapped Hamiltonians: An efficient Quantum Lovász Local Lemma
On preparing ground states of gapped Hamiltonians: An efficient Quantum Lovász Local Lemma András Gilyén QuSoft, CWI, Amsterdam, Netherlands Joint work with: Or Sattath Hebrew University and MIT 1 / 20
More informationProbabilistic Combinatorics. Jeong Han Kim
Probabilistic Combinatorics Jeong Han Kim 1 Tentative Plans 1. Basics for Probability theory Coin Tossing, Expectation, Linearity of Expectation, Probability vs. Expectation, Bool s Inequality 2. First
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 9
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Prof. Nick Harvey Lecture 9 University of British Columbia 1 Polynomial Identity Testing In the first lecture we discussed the problem of testing equality
More informationOptimization of Submodular Functions Tutorial - lecture I
Optimization of Submodular Functions Tutorial - lecture I Jan Vondrák 1 1 IBM Almaden Research Center San Jose, CA Jan Vondrák (IBM Almaden) Submodular Optimization Tutorial 1 / 1 Lecture I: outline 1
More informationAn estimate for the probability of dependent events
Statistics and Probability Letters 78 (2008) 2839 2843 Contents lists available at ScienceDirect Statistics and Probability Letters journal homepage: www.elsevier.com/locate/stapro An estimate for the
More informationThe Chromatic Symmetric Function: Hypergraphs and Beyond
The : Hypergraphs and Beyond arxiv:6.0969 Department of Mathematics Michigan State University Graduate Student Combinatorics Conference, April 07 Outline Introducing the chromatic symmetric function Definition
More informationThe Probabilistic Method
The Probabilistic Method Janabel Xia and Tejas Gopalakrishna MIT PRIMES Reading Group, mentors Gwen McKinley and Jake Wellens December 7th, 2018 Janabel Xia and Tejas Gopalakrishna Probabilistic Method
More informationLecture 1 : Probabilistic Method
IITM-CS6845: Theory Jan 04, 01 Lecturer: N.S.Narayanaswamy Lecture 1 : Probabilistic Method Scribe: R.Krithika The probabilistic method is a technique to deal with combinatorial problems by introducing
More informationThe Lopsided Lovász Local Lemma
Department of Mathematics Nebraska Wesleyan University With Linyuan Lu and László Székely, University of South Carolina Note on Probability Spaces For this talk, every a probability space Ω is assumed
More informationSPIN SYSTEMS: HARDNESS OF APPROXIMATE COUNTING VIA PHASE TRANSITIONS
SPIN SYSTEMS: HARDNESS OF APPROXIMATE COUNTING VIA PHASE TRANSITIONS Andreas Galanis Joint work with: Jin-Yi Cai Leslie Ann Goldberg Heng Guo Mark Jerrum Daniel Štefankovič Eric Vigoda The Power of Randomness
More informationPCPs and Inapproximability Gap-producing and Gap-Preserving Reductions. My T. Thai
PCPs and Inapproximability Gap-producing and Gap-Preserving Reductions My T. Thai 1 1 Hardness of Approximation Consider a maximization problem Π such as MAX-E3SAT. To show that it is NP-hard to approximation
More informationLecture 11 October 7, 2013
CS 4: Advanced Algorithms Fall 03 Prof. Jelani Nelson Lecture October 7, 03 Scribe: David Ding Overview In the last lecture we talked about set cover: Sets S,..., S m {,..., n}. S has cost c S. Goal: Cover
More informationThe Lefthanded Local Lemma characterizes chordal dependency graphs
The Lefthanded Local Lemma characterizes chordal dependency graphs Wesley Pegden March 30, 2012 Abstract Shearer gave a general theorem characterizing the family L of dependency graphs labeled with probabilities
More informationColoring Uniform Hypergraphs with Few Colors*
Coloring Uniform Hypergraphs with Few Colors* Alexandr Kostochka 1,2 1 University of Illinois at Urbana-Champaign, Urbana, Illinois 61801; e-mail: kostochk@mathuiucedu 2 Institute of Mathematics, Novosibirsk
More informationKnapsack. Bag/knapsack of integer capacity B n items item i has size s i and profit/weight w i
Knapsack Bag/knapsack of integer capacity B n items item i has size s i and profit/weight w i Goal: find a subset of items of maximum profit such that the item subset fits in the bag Knapsack X: item set
More informationOn subgraphs of large girth
1/34 On subgraphs of large girth In Honor of the 50th Birthday of Thomas Vojtěch Rödl rodl@mathcs.emory.edu joint work with Domingos Dellamonica May, 2012 2/34 3/34 4/34 5/34 6/34 7/34 ARRANGEABILITY AND
More informationLocal MAX-CUT in Smoothed Polynomial Time
Local MAX-CUT in Smoothed Polynomial Time Omer Angel 1 Sebastien Bubeck 2 Yuval Peres 2 Fan Wei 3 1 University of British Columbia 2 Microsoft Research Redmond 3 Stanford University November 9, 2016 Introduction
More informationThe Monte Carlo Method
The Monte Carlo Method Example: estimate the value of π. Choose X and Y independently and uniformly at random in [0, 1]. Let Pr(Z = 1) = π 4. 4E[Z] = π. { 1 if X Z = 2 + Y 2 1, 0 otherwise, Let Z 1,...,
More informationn Boolean variables: x 1, x 2,...,x n 2 {true,false} conjunctive normal form:
Advanced Algorithms k-sat n Boolean variables: x 1, x 2,...,x n 2 {true,false} conjunctive normal form: k-cnf = C 1 ^C 2 ^ ^C m Is φ satisfiable? m clauses: C 1,C 2,...,C m each clause C i = `i1 _ `i2
More informationLecture 13 March 7, 2017
CS 224: Advanced Algorithms Spring 2017 Prof. Jelani Nelson Lecture 13 March 7, 2017 Scribe: Hongyao Ma Today PTAS/FPTAS/FPRAS examples PTAS: knapsack FPTAS: knapsack FPRAS: DNF counting Approximation
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 22 September 2009
College of Computer & Information Science Fall 2009 Northeastern University 22 September 2009 CS 7880: Algorithmic Power Tools Scribe: Eric Miles Lecture Outline: General Lovász Local Lemma Two Simple
More informationarxiv: v1 [math.co] 18 Nov 2017
Short proofs for generalizations of the Lovász Local Lemma: Shearer s condition and cluster expansion arxiv:171106797v1 [mathco] 18 Nov 2017 Nicholas J A Harvey Abstract Jan Vondrák The Lovász Local Lemma
More informationCounting Colorings on Cubic Graphs
Counting Colorings on Cubic Graphs Chihao Zhang The Chinese University of Hong Kong Joint work with Pinyan Lu (Shanghai U of Finance and Economics) Kuan Yang (Oxford University) Minshen Zhu (Purdue University)
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationGood Triangulations. Jean-Daniel Boissonnat DataShape, INRIA
Good Triangulations Jean-Daniel Boissonnat DataShape, INRIA http://www-sop.inria.fr/geometrica Algorithmic Geometry Good Triangulations J-D. Boissonnat 1 / 29 Definition and existence of nets Definition
More informationUmans Complexity Theory Lectures
Complexity Theory Umans Complexity Theory Lectures Lecture 1a: Problems and Languages Classify problems according to the computational resources required running time storage space parallelism randomness
More informationThe Budgeted Unique Coverage Problem and Color-Coding (Extended Abstract)
The Budgeted Unique Coverage Problem and Color-Coding (Extended Abstract) Neeldhara Misra 1, Venkatesh Raman 1, Saket Saurabh 2, and Somnath Sikdar 1 1 The Institute of Mathematical Sciences, Chennai,
More informationThe Ising Partition Function: Zeros and Deterministic Approximation
58th Annual IEEE Symposium on Foundations of Computer Science The Ising Partition Function: Zeros and Deterministic Approximation Jingcheng Liu University of California, Berkeley Email: liuexp@berkeley.edu
More informationEnumeration: logical and algebraic approach
Enumeration: logical and algebraic approach Yann Strozecki Université Paris Sud - Paris 11 Novembre 2011, séminaire ALGO/LIX Introduction to Enumeration Enumeration and logic Enumeration and polynomials
More informationTwo-coloring random hypergraphs
Two-coloring random hypergraphs Dimitris Achlioptas Jeong Han Kim Michael Krivelevich Prasad Tetali December 17, 1999 Technical Report MSR-TR-99-99 Microsoft Research Microsoft Corporation One Microsoft
More informationThe Complexity of Approximating Small Degree Boolean #CSP
The Complexity of Approximating Small Degree Boolean #CSP Pinyan Lu, ITCS@SUFE Institute for Theoretical Computer Science Shanghai University of Finance and Economics Counting CSP F (Γ) is a family of
More informationImproved FPTAS for Multi-Spin Systems
Improved FPTAS for Multi-Spin Systems Pinyan Lu and Yitong Yin 2 Microsoft Research Asia, China. pinyanl@microsoft.com 2 State Key Laboratory for Novel Software Technology, Nanjing University, China. yinyt@nju.edu.cn
More informationLecture 5: Probabilistic tools and Applications II
T-79.7003: Graphs and Networks Fall 2013 Lecture 5: Probabilistic tools and Applications II Lecturer: Charalampos E. Tsourakakis Oct. 11, 2013 5.1 Overview In the first part of today s lecture we will
More informationLecture 5: January 30
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 5: January 30 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More information1 Randomized Computation
CS 6743 Lecture 17 1 Fall 2007 1 Randomized Computation Why is randomness useful? Imagine you have a stack of bank notes, with very few counterfeit ones. You want to choose a genuine bank note to pay at
More informationTHE MOSER-TARDOS FRAMEWORK WITH PARTIAL RESAMPLING
THE MOSER-TARDOS FRAMEWORK WITH PARTIAL RESAMPLING DAVID G. HARRIS 1 AND ARAVIND SRINIVASAN 2 Abstract. The resampling algorithm of Moser & Tardos is a powerful approach to develop constructive versions
More informationA Lower Bound for the Distributed Lovász Local Lemma
A Lower Bound for the Distributed Lovász Local Lemma Sebastian Brandt ETH Zurich, Switzerland Barbara Keller ETH Zurich, Switzerland Jukka Suomela HIIT, Department of Computer Science, Aalto University,
More informationLecture 7. The Cluster Expansion Lemma
Stanford Universit Spring 206 Math 233: Non-constructive methods in combinatorics Instructor: Jan Vondrák Lecture date: Apr 3, 206 Scribe: Erik Bates Lecture 7. The Cluster Expansion Lemma We have seen
More informationarxiv: v3 [cs.cc] 21 Jun 2017
Inapproximability of the independent set polynomial below the Shearer threshold Andreas Galanis Leslie Ann Goldberg Daniel Štefankovič arxiv:1612.05832v3 [cs.cc] 21 Jun 2017 21 June, 2017 Abstract We study
More informationHypergraph Matching by Linear and Semidefinite Programming. Yves Brise, ETH Zürich, Based on 2010 paper by Chan and Lau
Hypergraph Matching by Linear and Semidefinite Programming Yves Brise, ETH Zürich, 20110329 Based on 2010 paper by Chan and Lau Introduction Vertex set V : V = n Set of hyperedges E Hypergraph matching:
More informationOn a hypergraph matching problem
On a hypergraph matching problem Noga Alon Raphael Yuster Abstract Let H = (V, E) be an r-uniform hypergraph and let F 2 V. A matching M of H is (α, F)- perfect if for each F F, at least α F vertices of
More informationVertex colorings of graphs without short odd cycles
Vertex colorings of graphs without short odd cycles Andrzej Dudek and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 1513, USA {adudek,rramadur}@andrew.cmu.edu
More informationMath 261A Probabilistic Combinatorics Instructor: Sam Buss Fall 2015 Homework assignments
Math 261A Probabilistic Combinatorics Instructor: Sam Buss Fall 2015 Homework assignments Problems are mostly taken from the text, The Probabilistic Method (3rd edition) by N Alon and JH Spencer Please
More information1 The Knapsack Problem
Comp 260: Advanced Algorithms Prof. Lenore Cowen Tufts University, Spring 2018 Scribe: Tom Magerlein 1 Lecture 4: The Knapsack Problem 1 The Knapsack Problem Suppose we are trying to burgle someone s house.
More informationAdvanced Combinatorial Optimization Feb 13 and 25, Lectures 4 and 6
18.438 Advanced Combinatorial Optimization Feb 13 and 25, 2014 Lectures 4 and 6 Lecturer: Michel X. Goemans Scribe: Zhenyu Liao and Michel X. Goemans Today, we will use an algebraic approach to solve the
More informationColoring Simple Hypergraphs
Department of Mathematics, Statistics and Computer Science University of Illinois Chicago May 13, 2011 A Puzzle Problem Let n 2 and suppose that S [n] [n] with S 2n 1. Then some three points in S determine
More informationarxiv: v2 [cs.ds] 28 Jun 2018
THE ISING PARTITION FUNCTION: ZEROS AND DETERMINISTIC APPROXIMATION JINGCHENG LIU, ALISTAIR SINCLAIR, AND PIYUSH SRIVASTAVA arxiv:704.06493v2 [cs.ds] 28 Jun 208 Abstract. We study the problem of approximating
More informationRobin Moser makes Lovász Local Lemma Algorithmic! Notes of Joel Spencer
Robin Moser makes Lovász Local Lemma Algorithmic! Notes of Joel Spencer 1 Preliminaries The idea in these notes is to explain a new approach of Robin Moser 1 to give an algorithm for the Lovász Local Lemma.
More informationContents. Typical techniques. Proving hardness. Constructing efficient algorithms
Contents Typical techniques Proving hardness Constructing efficient algorithms Generating Maximal Independent Sets Consider the generation of all maximal sets of an independence system. Generating Maximal
More informationInapproximability After Uniqueness Phase Transition in Two-Spin Systems
Inapproximability After Uniqueness Phase Transition in Two-Spin Systems Jin-Yi Cai Xi Chen Heng Guo Pinyan Lu Abstract A two-state spin system is specified by a matrix [ A0,0 A A = 0,1 = A 1,0 A 1,1 [
More informationLecture 20: PSPACE. November 15, 2016 CS 1010 Theory of Computation
Lecture 20: PSPACE November 15, 2016 CS 1010 Theory of Computation Recall that PSPACE = k=1 SPACE(nk ). We will see that a relationship between time and space complexity is given by: P NP PSPACE = NPSPACE
More informationA Different Perspective For Approximating Max Set Packing
Weizmann Institute of Science Thesis for the degree Master of Science Submitted to the Scientific Council of the Weizmann Institute of Science Rehovot, Israel A Different Perspective For Approximating
More informationEssential facts about NP-completeness:
CMPSCI611: NP Completeness Lecture 17 Essential facts about NP-completeness: Any NP-complete problem can be solved by a simple, but exponentially slow algorithm. We don t have polynomial-time solutions
More informationImproved Bounds for Flow Shop Scheduling
Improved Bounds for Flow Shop Scheduling Monaldo Mastrolilli and Ola Svensson IDSIA - Switzerland. {monaldo,ola}@idsia.ch Abstract. We resolve an open question raised by Feige & Scheideler by showing that
More informationSymmetry and hardness of submodular maximization problems
Symmetry and hardness of submodular maximization problems Jan Vondrák 1 1 Department of Mathematics Princeton University Jan Vondrák (Princeton University) Symmetry and hardness 1 / 25 Submodularity Definition
More informationOn the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring
On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring Ioannis Giotis,2, Lefteris Kirousis,2, Kostas I. Psaromiligkos, and Dimitrios M. Thilikos,2,3 Department of Mathematics, National & Kapodistrian
More information1 Agenda. 2 History. 3 Probabilistically Checkable Proofs (PCPs). Lecture Notes Definitions. PCPs. Approximation Algorithms.
CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 20 April 12, 2010 Scribe: Jonathan Pines 1 Agenda. PCPs. Approximation Algorithms. PCPs = Inapproximability. 2 History. First, some history
More informationarxiv: v5 [cs.ds] 2 Oct 2011
New Constructive Aspects of the Lovász Local Lemma Bernhard Haeupler Barna Saha Aravind Srinivasan October 4, 2011 arxiv:1001.1231v5 [cs.ds] 2 Oct 2011 Abstract The Lovász Local Lemma (LLL) is a powerful
More informationThe complexity of acyclic subhypergraph problems
The complexity of acyclic subhypergraph problems David Duris and Yann Strozecki Équipe de Logique Mathématique (FRE 3233) - Université Paris Diderot-Paris 7 {duris,strozecki}@logique.jussieu.fr Abstract.
More informationConnections between exponential time and polynomial time problem Lecture Notes for CS294
Connections between exponential time and polynomial time problem Lecture Notes for CS294 Lecturer: Russell Impagliazzo Scribe: Stefan Schneider November 10, 2015 We connect problems that have exponential
More informationFPT hardness for Clique and Set Cover with super exponential time in k
FPT hardness for Clique and Set Cover with super exponential time in k Mohammad T. Hajiaghayi Rohit Khandekar Guy Kortsarz Abstract We give FPT-hardness for setcover and clique with super exponential time
More informationGraph Sparsifiers. Smaller graph that (approximately) preserves the values of some set of graph parameters. Graph Sparsification
Graph Sparsifiers Smaller graph that (approximately) preserves the values of some set of graph parameters Graph Sparsifiers Spanners Emulators Small stretch spanning trees Vertex sparsifiers Spectral sparsifiers
More informationarxiv: v1 [math.co] 2 Dec 2013
What is Ramsey-equivalent to a clique? Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó arxiv:1312.0299v1 [math.co] 2 Dec 2013 November 4, 2018 Abstract A graph G is Ramsey for H if every
More informationProperly colored Hamilton cycles in edge colored complete graphs
Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on
More informationLecture 6: September 22
CS294 Markov Chain Monte Carlo: Foundations & Applications Fall 2009 Lecture 6: September 22 Lecturer: Prof. Alistair Sinclair Scribes: Alistair Sinclair Disclaimer: These notes have not been subjected
More informationNotice that lemma 4 has nothing to do with 3-colorability. To obtain a better result for 3-colorable graphs, we need the following observation.
COMPSCI 632: Approximation Algorithms November 1, 2017 Lecturer: Debmalya Panigrahi Lecture 18 Scribe: Feng Gui 1 Overview In this lecture, we examine graph coloring algorithms. We first briefly discuss
More informationSolving All Lattice Problems in Deterministic Single Exponential Time
Solving All Lattice Problems in Deterministic Single Exponential Time (Joint work with P. Voulgaris, STOC 2010) UCSD March 22, 2011 Lattices Traditional area of mathematics Bridge between number theory
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationDominating Set. Chapter 7
Chapter 7 Dominating Set In this chapter we present another randomized algorithm that demonstrates the power of randomization to break symmetries. We study the problem of finding a small dominating set
More informationMonotone Submodular Maximization over a Matroid
Monotone Submodular Maximization over a Matroid Yuval Filmus January 31, 2013 Abstract In this talk, we survey some recent results on monotone submodular maximization over a matroid. The survey does not
More informationLecture 5: Counting independent sets up to the tree threshold
CS 7535: Markov Chain Monte Carlo Algorithms Fall 2014 Lecture 5: Counting independent sets up to the tree threshold Lecturer: Richard Brooks and Rakshit Trivedi Date: December 02 In this lecture, we will
More informationTopics on Computing and Mathematical Sciences I Graph Theory (6) Coloring I
Topics on Computing and Mathematical Sciences I Graph Theory (6) Coloring I Yoshio Okamoto Tokyo Institute of Technology May, 008 Last updated: Wed May 6: 008 Y. Okamoto (Tokyo Tech) TCMSI Graph Theory
More information