Lecture 13: 04/23/2014
|
|
- Abigail Ford
- 5 years ago
- Views:
Transcription
1 COMS : Sub-Linear Algorithms in Learning and Testing Lecturer: Rocco Servedio Lecture 13: 04/23/2014 Spring 2014 Scribe: Psallidas Fotios Administrative: Submit HW problem solutions by Wednesday, 04/26/ :59:59. 1 Overview 1.1 Last Time Graph property testing for (dense) graphs with N nodes and access to adjacency matrix (N sufficiently large); q-query testing with a O(q 2 )-query non-adaptive tester; Õ( 1 3 ) -query tester for bipartiteness ( ). 1.2 Today Broad generalization of ( ) for general graph partition properties (GGPT). Testing -freeness using O (1)-query algorithm: -removal lemma Szemerédi Regularization lemma Relevant readings Goldreich, Goldwasser, and Ron. Property testing and its connection to learning and approximation. [GGR98] Szemerédi. Regular partitions of graphs. [Sze78] 1
2 2 POLY( 1 )-QUERY TESTABLE GRAPH PROPERTIES 2 2 poly( 1 )-query testable graph properties Besides bipartiteness, some of the graph properties that were shown in [GGR98] to be testable with poly( 1 ) queries (and running time exponential in the number of queries) include the following: k-colorability Definition 1. Fix any integer k. A graph G(V, E) is said to be k-colorable if there exists a (proper) k-coloring of G, that is a mapping ϕ: V [k] such that (i, j) E ϕ(i) ϕ(j). In other terms, after assigning a color to each node, any two adjacent nodes i, j have different colors. Note that for k = 2, this is exactly bipartiteness. Theorem 2. For any fixed k 2, there is a poly( k )-query tester for k-colorability. B R G ρ-clique Definition 3. Fix any ρ (0, 1). A ρ-clique of an N-vertex graph is a collection of ρn vertices containing all the edges within them. Theorem 4. Let P def = { G N-vertex graph : G has a ρ-clique }. Then there is a poly( 1 )-query tester for P. N-1 N-2 v2 v1 v3 ρn N rho-clique (ρn vertices)
3 3 GENERAL GRAPH PARTITION TESTING (GGPT) 3 ρ-bisection Definition 5. Fix any ρ (0, 1/4). A ρ-bisection of an N-vertex graph G = (V, E) is a partition of V in two N -size subsets such that the number of edges 2 crossing from V 1 to V 2 is at most ρn 2 (that is, V 1, V 2 define a balanced, ρ-sparse cut of G). V1 pn 2 V2 Theorem 6. Let P def = { G N-vertex graph : G has a ρ-bisection }. Then there is a poly( 1 )-query tester for P. The similarity between these results is not fortuitous: it turns out they all fall into the same general setting, General Graph Partition Testing. 3 General Graph Partition Testing (GGPT) Bipartiteness, k-colorability, having a ρ-clique or having a ρ-bisection are special cases of a more general family of properties, the class of General Graph Partition Testing (GGPT) properties, which all admit constant-query testers a single meta-algorithm actually allows one to test any of these properties. More specifically, a GGPT property is specified by an integer k (number of pieces, i.e. size of the desired partition of the graph), as well as (a) size bounds for each of the k pieces and (b) edge density bounds for a pair between 2 pieces. Definition 7 (GGPT property). A General Graph Partition Testing property is specified by an integer k and a collection Φ of k + k 2 intervals in [0, 1]: Φ = {([l i, u i ]) i [k], [l i,j, u i,j ] i,j [k] }. Given k, Φ the property P k,φ is the set of all N-vertex graphs G = (V, E) for which there exists a k-way partition of V into V 1 V 2... V k satisfying (i) i [k], Nl i V i Nu i (ii) i, j [k] 2, N 2 l i,j E(V i, V j ) N 2 u i,j }{{} #edges between V i and V j (right density of vertices) (right density of edges)
4 4 TRIANGLE-FREENESS 4 As an example, consider the k-colorability property, which can be rephrased as a GGPT as follows: [l 1, u 1 ] = [l 2, u 2 ] =... = [l k, u k ] = [0, 1]; [l 1,1, u 1,1 ] = [l 1,1, u 1,2 ] =... = [l k,k, u k,k ] = {0}; [l i,j, u i,j ] = [0, 1] for all i, j [k] with i j. Theorem 8 (Testing GGPT properties). Given any k and Φ, the property P k,φ is testable with ( k )O(k) queries (and running time exponential in the query complexity). Proof sketch. Using the same high-level idea as in the bipartiteness tester: (1) First, draw a small set of vertices and query all pairs of these; call the resulting graph G (note that the number of possible partitions of G is exponential in G ). (2) If G P k,φ, then some partition of G is good; this good partition induces a partial partition of G that will (approximately) satisfy the constraints. (3) Like for bipartiteness, draw a 2 nd sample and see if it complies with any partition of G. ( only need to worry about exp( G ) many partitions). 4 Triangle-freeness Definition 9 ( -freeness). Fix any graph G = (V, E). A triangle is a triple (i, j, k) V 3 such that (i, j), (j, k), (j, i) E. G is said to be triangle-free (or -free) if it does not contain any triangle. V2 V1 V3 Let P def = { G N-vertex graph : G is -free }. Then, the distance of a graph G from P is dist(g, P) = #edges one needs to erase to kill all triangles N 2 Analysis First, it is easy to see that if a graph G is -free, then Test -Freeness accepts with probability 1; and that it always makes at most 3s queries. Furthemore, if s is chosen big enough (e.g., N 2, N 3... ), Test -Freeness will work.
5 4 TRIANGLE-FREENESS 5 Algorithm 1 Test -Freeness 1: for s iterations do 2: Randomly pick v 1, v 2, v 3 nodes [N] 3: Query (v 1, v 2 ), (v 1, v 3 ) and (v 2, v 3 ) 4: return REJECT if the three edges exist (i.e., there is a ) 5: end for 6: return ACCEPT (none of the s iterations found a ) Question How small can s be? More specifically, is s = O (1) enough? Note that for O (1) many queries to suffice, it must be the case that G -far from -free G has Ω (1) N 3 triangles Fortunately, this is true; and is a corollary of the following lemma, that we will prove in the remaining part of this lecture: Theorem 10 ( -Removal Lemma). For all > 0, there exists δ > 0 such that any N-vertex graph G which is -far from -free contains at least δ N 3 triangles. (given this, Test -Freeness works with s set to 10/δ, as then (1 δ ) s 1/3) Proof. Consider first the very special case where G is an N-vertex α-dense random graph (i.e. any possible edge is in E independently with probability α). In such a graph, the probability of a triangle existing between 3 nodes v 1, v 2 and v 3 is [ ] v 3 Pr v1 v2 = Pr[ (v 1, v 2 ) E ] Pr[ (v 1, v 3 ) E ] Pr[ (v 2, v 3 ) E ] = α 3 and by linearity the expected number of triangles is E[# ] = α 3( ) N 3 (and one can show that the graph is Θ(α)-far from -free). Thus, in this case, δ = α 3 works for the statement of the -Removal Lemma. However, we do not deal with random graphs here, but arbitrary graphs. The key will be to argue that these graphs still present some structure, namely have enough regularity and that this regularity is roughly equivalent, for our purposes, to behaving like random graphs.
6 4 TRIANGLE-FREENESS 6 Definition 11 (Density). Given disjoints sets X, Y [N] of a graph G, the density d(x, Y ) is defined as where e(x, Y ) def = E(X, Y ). d(x, Y ) def = e(x, Y ) X Y Recall that a partition of [N] is a collection of disjoint subsets V 1, V 2,..., V k such that k i=1 V i = [N]. Definition 12 (Regularity). Let A, B [N] be disjoint. The pair (A, B) is said to be -regular if for all X A, Y B with X A and Y B one has d(a, B) d(x, Y ). The idea is to show that regularity is sufficient to ensure lots of triangles, just like in the case of random graphs. Lemma 13. Fix 0 < α < 1 and 0 < < α. Suppose A, B, C [N] are disjoint 2 2 subsets such that each pair (A, B), (A, C), and (B, C) is both (i) -regular and (ii) α-dense. Then the number of A C B triangles is at least α3 A B C. 16 C Cu A A* u B Bu Proof. First we show that A has many well-connected vertices (adjacent to many elements of both B and C). Define A def = { a A : a has both at least (α ) B neighbors in B and (α ) C in C }. Claim 14. A (1 2) A.
7 4 TRIANGLE-FREENESS 7 Proof. Let A bad(b) A be { a A : a has < (α ) B neighbors in B }. We have d(a bad(b), B) = e(a bad(b), B) A bad(b) B < A bad(b) (α ) B A bad(b) B = (α ). Since d(a, B) α by assumption, we get d(a, B) d(abad(b), B) > ; and so, (A, B) being -regular, we must have by contrapositive A bad(b) < A. Analogously, define A bad(c) : we obtain Abad(C) < A, and therefore A A Abad(B) Abad(C) (1 2)A. Now we will use A to get a lot of triangles as follows: for a vertex u A (that is, a well-connected vertex see Figure 4), let B u def = { b B : (u, b) E } C u def = { c C : (u, c) E } Every edge between B u with C u gives a triangle with u; to get many of them, we want to lower bound But since u A, B u and C u both are large: e(b u, C u ) = d(b u, C u ) B u C u. (1) B u (α ) B α 2 C u (α ) C α 2 B B C C and this also implies, as (B, C is -regular, that d(b u, C u ) d(b, C) α > α 2 and thus, plugging these back in (1), e(b u, C u ) α3 B C. So finally, the total C number of A B triangles is at least e(b u, C u ) (1 2) A α3 u A 8 8 α3 B C A B C. 16
8 4 TRIANGLE-FREENESS 8 To conclude the proof of the -Removal Lemma, we conjure an amazing fact (or miracle): Szemerédi Regularity Lemma. This structural result, from [Sze78], is a cornerstone in graph property testing which states that every sufficiently large graph can be divided into subsets of about the same size so that the edges between different subsets behave almost as in a random graph. More formally: Theorem 15 (Szemerédi Regularity Lemma). Given > 0 and m 0 1, there exist M = M(, m 0 ) (upperbound on the number of pieces of the partition) and K = K(, m 0 ) such that for any graph G = (V, E) with at least K vertices there exists an integer m and a partition of V into V 0, V 1,..., V m satisfying: (i) V 1 = V 2 =... = V m ; (ii) V 0 V ; (iii) m 0 m M, and (iv) at most m 2 pairs (V i, V j ) are not -regular. (all same size) (slop bin) As a small catch, however, one feels compelled to point out that M can be as large as where the tower of 2 s has height 1/ 5 (and, sadly, one cannot hope to get much improvement, as lowerbounds on this height have been proven). However, the amazing fact is that this is still completely independent of N: no matter how big N K is, M will not change by a iota. Now for the kill: prove: recall the statement of the -Removal Lemma we want to > 0 δ such that any N-vertex G -far from -free has at least δ N 3 s. We will use the Szemerédi Regularity Lemma (SRL) above to finish the proof. We are given > 0; set m 0 = 10, and apply SRL on G with parameter chosen to be. This guarantees the existence of M = M(), K = K() such that if N K 10 there exists a partition V 0 V 1... V m of V with 10 m M; at most 10 m2 pairs V i, V j are not 10 -regular;
9 4 TRIANGLE-FREENESS 9 V 0 N; and 10 V 1 = V 2 =... = V m [ (1 10 )N M, ] N 10. def Now, if N < K then set δ = 1 1, so that 0 < δ 2 K 3 1. It suffices to have G 2 containing at least one triangle for the statement of the theorem to hold, which is true as G is -far from -free (so must contain at least one triangle). Goal: assuming now N K, we want to modify G so that we can use Lemma 13. Let G be obtained from G by: (1) removing all edges incident to V 0, (at most 10 N V = 10 N 2 edges) (2) removing all edges within V i, for i [m], (at most m (N/m ) 2 m N 2 2m = N 2 2 2m 20 N 2 edges) (3) removing all edges between V i and V j if (V i, V j ) is not -regular, 10 (at most 10 m2 ( ) N 2 m 10 N 2 edges) (4) removing all edges between V i and V j if d(v i, V j ) 5 ( (at most m 2 N ) 2 5 m 5 N 2 edges). In total, this removes at most 9 20 N 2 edges from G: since G is -far from -free, it follows that G has at least one remaining triangle. This triangle, by construction of G, has to be between of the form V k V i i.e. between some V i, V j, V k for distinct i, j, k, with V i, V j, V k simultanously regular and -dense. Therefore, from Lemma 13 there are at least 5 V j ( 5 )3 16 V i V j V k ( 5 )3 16 ( (1 10 )N M ( def many triangles in G. Choosing δ = 1 N ( M 10 )) 3 then concludes the proof. )
10 REFERENCES 10 References [GGR98] Oded Goldreich, Shari Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. J. ACM, 45(4): , July [Sze78] E. Szemerédi. Regular partitions of graphs. Problemés combinatoires et theorie des graphes, pages , 1978.
Lecture 1: 01/22/2014
COMS 6998-3: Sub-Linear Algorithms in Learning and Testing Lecturer: Rocco Servedio Lecture 1: 01/22/2014 Spring 2014 Scribes: Clément Canonne and Richard Stark 1 Today High-level overview Administrative
More informationA Combinatorial Characterization of the Testable Graph Properties: It s All About Regularity
A Combinatorial Characterization of the Testable Graph Properties: It s All About Regularity Noga Alon Eldar Fischer Ilan Newman Asaf Shapira Abstract A common thread in all the recent results concerning
More informationLecture 5: Derandomization (Part II)
CS369E: Expanders May 1, 005 Lecture 5: Derandomization (Part II) Lecturer: Prahladh Harsha Scribe: Adam Barth Today we will use expanders to derandomize the algorithm for linearity test. Before presenting
More informationHomomorphisms in Graph Property Testing - A Survey
Homomorphisms in Graph Property Testing - A Survey Dedicated to Jaroslav Nešetřil on the occasion of his 60 th birthday Noga Alon Asaf Shapira Abstract Property-testers are fast randomized algorithms for
More informationA Generalized Turán Problem and its Applications
A Generalized Turán Problem and its Applications Lior Gishboliner Asaf Shapira Abstract The investigation of conditions guaranteeing the appearance of cycles of certain lengths is one of the most well-studied
More informationTHE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION
THE SZEMERÉDI REGULARITY LEMMA AND ITS APPLICATION YAQIAO LI In this note we will prove Szemerédi s regularity lemma, and its application in proving the triangle removal lemma and the Roth s theorem on
More informationA Characterization of the (natural) Graph Properties Testable with One-Sided Error
A Characterization of the (natural) Graph Properties Testable with One-Sided Error Noga Alon Asaf Shapira Abstract The problem of characterizing all the testable graph properties is considered by many
More informationA Combinatorial Characterization of the Testable Graph Properties: It s All About Regularity
A Combinatorial Characterization of the Testable Graph Properties: It s All About Regularity ABSTRACT Noga Alon Tel-Aviv University and IAS nogaa@tau.ac.il Ilan Newman Haifa University ilan@cs.haifa.ac.il
More informationEvery Monotone Graph Property is Testable
Every Monotone Graph Property is Testable Noga Alon Asaf Shapira Abstract A graph property is called monotone if it is closed under removal of edges and vertices. Many monotone graph properties are some
More informationA Characterization of the (natural) Graph Properties Testable with One-Sided Error
A Characterization of the (natural) Graph Properties Testable with One-Sided Error Noga Alon Asaf Shapira Abstract The problem of characterizing all the testable graph properties is considered by many
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 2 Luca Trevisan August 29, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analysis Handout Luca Trevisan August 9, 07 Scribe: Mahshid Montazer Lecture In this lecture, we study the Max Cut problem in random graphs. We compute the probable
More informationEvery Monotone Graph Property is Testable
Every Monotone Graph Property is Testable Noga Alon Asaf Shapira Abstract A graph property is called monotone if it is closed under removal of edges and vertices. Many monotone graph properties are some
More informationSublinear Algorithms Lecture 3. Sofya Raskhodnikova Penn State University
Sublinear Algorithms Lecture 3 Sofya Raskhodnikova Penn State University 1 Graph Properties Testing if a Graph is Connected [Goldreich Ron] Input: a graph G = (V, E) on n vertices in adjacency lists representation
More information3 Finish learning monotone Boolean functions
COMS 6998-3: Sub-Linear Algorithms in Learning and Testing Lecturer: Rocco Servedio Lecture 5: 02/19/2014 Spring 2014 Scribes: Dimitris Paidarakis 1 Last time Finished KM algorithm; Applications of KM
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 informationUpper Bounds of Dynamic Chromatic Number
Upper Bounds of Dynamic Chromatic Number Hong-Jian Lai, Bruce Montgomery and Hoifung Poon Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 June 22, 2000 Abstract A proper vertex
More informationLecture 9: March 26, 2014
COMS 6998-3: Sub-Linear Algorithms in Learning and Testing Lecturer: Rocco Servedio Lecture 9: March 26, 204 Spring 204 Scriber: Keith Nichols Overview. Last Time Finished analysis of O ( n ɛ ) -query
More informationEfficient testing of large graphs
Efficient testing of large graphs Noga Alon Eldar Fischer Michael Krivelevich Mario Szegedy Abstract Let P be a property of graphs. An ɛ-test for P is a randomized algorithm which, given the ability to
More informationPaul Erdős and Graph Ramsey Theory
Paul Erdős and Graph Ramsey Theory Benny Sudakov ETH and UCLA Ramsey theorem Ramsey theorem Definition: The Ramsey number r(s, n) is the minimum N such that every red-blue coloring of the edges of a complete
More informationAdditive Combinatorics and Szemerédi s Regularity Lemma
Additive Combinatorics and Szemerédi s Regularity Lemma Vijay Keswani Anurag Sahay 20th April, 2015 Supervised by : Dr. Rajat Mittal 1 Contents 1 Introduction 3 2 Sum-set Estimates 4 2.1 Size of sumset
More informationLecture 10. Sublinear Time Algorithms (contd) CSC2420 Allan Borodin & Nisarg Shah 1
Lecture 10 Sublinear Time Algorithms (contd) CSC2420 Allan Borodin & Nisarg Shah 1 Recap Sublinear time algorithms Deterministic + exact: binary search Deterministic + inexact: estimating diameter in a
More informationCIS 800/002 The Algorithmic Foundations of Data Privacy September 29, Lecture 6. The Net Mechanism: A Partial Converse
CIS 800/002 The Algorithmic Foundations of Data Privacy September 29, 20 Lecturer: Aaron Roth Lecture 6 Scribe: Aaron Roth Finishing up from last time. Last time we showed: The Net Mechanism: A Partial
More informationSzemerédi s Lemma for the Analyst
Szemerédi s Lemma for the Analyst László Lovász and Balázs Szegedy Microsoft Research April 25 Microsoft Research Technical Report # MSR-TR-25-9 Abstract Szemerédi s Regularity Lemma is a fundamental tool
More informationEvery Monotone Graph Property is Testable
Every Monotone Graph Property is Testable Noga Alon Tel Aviv University Tel Aviv, Isarel nogaa@tau.ac.il Asaf Shapira Tel Aviv University Tel Aviv, Isarel asafico@tau.ac.il ABSTRACT A graph property is
More informationScribes: Po-Hsuan Wei, William Kuzmaul Editor: Kevin Wu Date: October 18, 2016
CS 267 Lecture 7 Graph Spanners Scribes: Po-Hsuan Wei, William Kuzmaul Editor: Kevin Wu Date: October 18, 2016 1 Graph Spanners Our goal is to compress information about distances in a graph by looking
More informationAlgorithms Reading Group Notes: Provable Bounds for Learning Deep Representations
Algorithms Reading Group Notes: Provable Bounds for Learning Deep Representations Joshua R. Wang November 1, 2016 1 Model and Results Continuing from last week, we again examine provable algorithms for
More informationCS 6820 Fall 2014 Lectures, October 3-20, 2014
Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given
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 informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
More informationLecture 7: Schwartz-Zippel Lemma, Perfect Matching. 1.1 Polynomial Identity Testing and Schwartz-Zippel Lemma
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 7: Schwartz-Zippel Lemma, Perfect Matching Lecturer: Shayan Oveis Gharan 01/30/2017 Scribe: Philip Cho Disclaimer: These notes have not
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationAlgorithmic Aspects of Property Testing in the Dense Graphs Model
Algorithmic Aspects of Property Testing in the Dense Graphs Model Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. oded.goldreich@weizmann.ac.il Dana Ron Department
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CSE 5311 Lecture 25 NP Completeness Junzhou Huang, Ph.D. Department of Computer Science and Engineering CSE5311 Design and Analysis of Algorithms 1 NP-Completeness Some
More informationApproximate Hypergraph Partitioning and Applications
Approximate Hypergraph Partitioning and Applications Eldar Fischer Arie Matsliah Asaf Shapira Abstract Szemerédi s regularity lemma is a corner-stone result in extremal combinatorics. It (roughly) asserts
More informationSZEMERÉDI S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS
SZEMERÉDI S REGULARITY LEMMA FOR MATRICES AND SPARSE GRAPHS ALEXANDER SCOTT Abstract. Szemerédi s Regularity Lemma is an important tool for analyzing the structure of dense graphs. There are versions of
More information25.1 Markov Chain Monte Carlo (MCMC)
CS880: Approximations Algorithms Scribe: Dave Andrzejewski Lecturer: Shuchi Chawla Topic: Approx counting/sampling, MCMC methods Date: 4/4/07 The previous lecture showed that, for self-reducible problems,
More informationA Characterization of Locally Testable Affine-Invariant Properties via Decomposition Theorems
A Characterization of Locally Testable Affine-Invariant Properties via Decomposition Theorems Yuichi Yoshida National Institute of Informatics and Preferred Infrastructure, Inc June 1, 2014 Yuichi Yoshida
More informationRemoval Lemmas with Polynomial Bounds
Removal Lemmas with Polynomial Bounds Lior Gishboliner Asaf Shapira Abstract A common theme in many extremal problems in graph theory is the relation between local and global properties of graphs. One
More informationChromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz Jacob Fox Choongbum Lee Benny Sudakov Abstract For a graph G, let χ(g) denote its chromatic number and σ(g) denote
More informationThe Turán number of sparse spanning graphs
The Turán number of sparse spanning graphs Noga Alon Raphael Yuster Abstract For a graph H, the extremal number ex(n, H) is the maximum number of edges in a graph of order n not containing a subgraph isomorphic
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 informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
More informationLower Bounds for Testing Bipartiteness in Dense Graphs
Lower Bounds for Testing Bipartiteness in Dense Graphs Andrej Bogdanov Luca Trevisan Abstract We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due
More informationLecture 4: NP and computational intractability
Chapter 4 Lecture 4: NP and computational intractability Listen to: Find the longest path, Daniel Barret What do we do today: polynomial time reduction NP, co-np and NP complete problems some examples
More informationThe regularity method and blow-up lemmas for sparse graphs
The regularity method and blow-up lemmas for sparse graphs Y. Kohayakawa (São Paulo) SPSAS Algorithms, Combinatorics and Optimization University of São Paulo July 2016 Partially supported CAPES/DAAD (430/15),
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationKernelization by matroids: Odd Cycle Transversal
Lecture 8 (10.05.2013) Scribe: Tomasz Kociumaka Lecturer: Marek Cygan Kernelization by matroids: Odd Cycle Transversal 1 Introduction The main aim of this lecture is to give a polynomial kernel for the
More informationSzemerédi s regularity lemma revisited. Lewis Memorial Lecture March 14, Terence Tao (UCLA)
Szemerédi s regularity lemma revisited Lewis Memorial Lecture March 14, 2008 Terence Tao (UCLA) 1 Finding models of large dense graphs Suppose we are given a large dense graph G = (V, E), where V is a
More informationProof of the (n/2 n/2 n/2) Conjecture for large n
Proof of the (n/2 n/2 n/2) Conjecture for large n Yi Zhao Department of Mathematics and Statistics Georgia State University Atlanta, GA 30303 September 9, 2009 Abstract A conjecture of Loebl, also known
More informationTesting Graph Isomorphism
Testing Graph Isomorphism Eldar Fischer Arie Matsliah Abstract Two graphs G and H on n vertices are ɛ-far from being isomorphic if at least ɛ ( n 2) edges must be added or removed from E(G) in order to
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 informationRobust local testability of tensor products of LDPC codes
Robust local testability of tensor products of LDPC codes Irit Dinur 1, Madhu Sudan, and Avi Wigderson 3 1 Hebrew University, Jerusalem, Israel. dinuri@cs.huji.ac.il Massachusetts Institute of Technology,
More informationClassical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems Rani M. R, Mohith Jagalmohanan, R. Subashini Binary matrices having simultaneous consecutive
More informationLecture 15: Expanders
CS 710: Complexity Theory 10/7/011 Lecture 15: Expanders Instructor: Dieter van Melkebeek Scribe: Li-Hsiang Kuo In the last lecture we introduced randomized computation in terms of machines that have access
More informationTesting Cluster Structure of Graphs. Artur Czumaj
Testing Cluster Structure of Graphs Artur Czumaj DIMAP and Department of Computer Science University of Warwick Joint work with Pan Peng and Christian Sohler (TU Dortmund) Dealing with BigData in Graphs
More informationProject in Computational Game Theory: Communities in Social Networks
Project in Computational Game Theory: Communities in Social Networks Eldad Rubinstein November 11, 2012 1 Presentation of the Original Paper 1.1 Introduction In this section I present the article [1].
More informationRao s degree sequence conjecture
Rao s degree sequence conjecture Maria Chudnovsky 1 Columbia University, New York, NY 10027 Paul Seymour 2 Princeton University, Princeton, NJ 08544 July 31, 2009; revised December 10, 2013 1 Supported
More informationREGULARITY LEMMAS FOR GRAPHS
REGULARITY LEMMAS FOR GRAPHS Abstract. Szemerédi s regularity lemma proved to be a fundamental result in modern graph theory. It had a number of important applications and is a widely used tool in extremal
More informationTesting that distributions are close
Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White May 26, 2010 Anat Ganor Introduction Goal Given two distributions over an n element set, we wish to check whether these distributions
More informationApplications of the Sparse Regularity Lemma
Applications of the Sparse Regularity Lemma Y. Kohayakawa (Emory and São Paulo) Extremal Combinatorics II DIMACS 2004 1 Szemerédi s regularity lemma 1. Works very well for large, dense graphs: n-vertex
More informationCS 583: Algorithms. NP Completeness Ch 34. Intractability
CS 583: Algorithms NP Completeness Ch 34 Intractability Some problems are intractable: as they grow large, we are unable to solve them in reasonable time What constitutes reasonable time? Standard working
More informationOn splitting digraphs
On splitting digraphs arxiv:707.03600v [math.co] 0 Apr 08 Donglei Yang a,, Yandong Bai b,, Guanghui Wang a,, Jianliang Wu a, a School of Mathematics, Shandong University, Jinan, 5000, P. R. China b Department
More informationInduced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs Pinar Heggernes Pim van t Hof Daniel Meister Yngve Villanger Abstract Given two graphs G and H as input, the Induced Subgraph
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationEarthmover resilience & testing in ordered structures
Earthmover resilience & testing in ordered structures Omri Ben-Eliezer Tel-Aviv University Eldar Fischer Technion Computational Complexity Conference 28 UCSD, San Diago Property testing (RS96, GGR98) Meta
More informationLecture 5: February 16, 2012
COMS 6253: Advanced Computational Learning Theory Lecturer: Rocco Servedio Lecture 5: February 16, 2012 Spring 2012 Scribe: Igor Carboni Oliveira 1 Last time and today Previously: Finished first unit on
More informationStability of the path-path Ramsey number
Worcester Polytechnic Institute Digital WPI Computer Science Faculty Publications Department of Computer Science 9-12-2008 Stability of the path-path Ramsey number András Gyárfás Computer and Automation
More informationFixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems
Fixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems Arash Rafiey Department of Informatics, University of Bergen, Norway arash.rafiey@ii.uib.no Abstract We consider
More informationSHORT PATHS IN 3-UNIFORM QUASI-RANDOM HYPERGRAPHS. Joanna Polcyn. Department of Discrete Mathematics Adam Mickiewicz University
Discussiones Mathematicae Graph Theory 24 (2004 ) 469 484 SHORT PATHS IN 3-UNIFORM QUASI-RANDOM HYPERGRAPHS Joanna Polcyn Department of Discrete Mathematics Adam Mickiewicz University Poznań e-mail: joaska@amu.edu.pl
More informationMatching Polynomials of Graphs
Spectral Graph Theory Lecture 25 Matching Polynomials of Graphs Daniel A Spielman December 7, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in class The notes
More informationAn Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs Zhi-Zhong Chen Ruka Tanahashi Lusheng Wang Abstract We present a polynomial-time approximation algorithm for legally coloring
More informationACO Comprehensive Exam October 14 and 15, 2013
1. Computability, Complexity and Algorithms (a) Let G be the complete graph on n vertices, and let c : V (G) V (G) [0, ) be a symmetric cost function. Consider the following closest point heuristic for
More information1 AC 0 and Håstad Switching Lemma
princeton university cos 522: computational complexity Lecture 19: Circuit complexity Lecturer: Sanjeev Arora Scribe:Tony Wirth Complexity theory s Waterloo As we saw in an earlier lecture, if PH Σ P 2
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationInduced Ramsey-type theorems
Induced Ramsey-type theorems Jacob Fox Benny Sudakov Abstract We present a unified approach to proving Ramsey-type theorems for graphs with a forbidden induced subgraph which can be used to extend and
More informationProofs of Proximity for Context-Free Languages and Read-Once Branching Programs
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs Oded Goldreich Weizmann Institute of Science oded.goldreich@weizmann.ac.il Ron D. Rothblum Weizmann Institute of Science
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 18: Zero-Knowledge Proofs
COM S 6810 Theory of Computing March 26, 2009 Lecture 18: Zero-Knowledge Proofs Instructor: Rafael Pass Scribe: Igor Gorodezky 1 The formal definition We intuitively defined an interactive proof to be
More informationLecture 7: Passive Learning
CS 880: Advanced Complexity Theory 2/8/2008 Lecture 7: Passive Learning Instructor: Dieter van Melkebeek Scribe: Tom Watson In the previous lectures, we studied harmonic analysis as a tool for analyzing
More informationMore NP-Complete Problems
CS 473: Algorithms, Spring 2018 More NP-Complete Problems Lecture 23 April 17, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 57 Recap NP: languages/problems that have
More informationLower Bounds for Testing Triangle-freeness in Boolean Functions
Lower Bounds for Testing Triangle-freeness in Boolean Functions Arnab Bhattacharyya Ning Xie Abstract Given a Boolean function f : F n 2 {0, 1}, we say a triple (x, y, x + y) is a triangle in f if f(x)
More informationGRAPHS WITH TINY VECTOR CHROMATIC NUMBERS AND HUGE CHROMATIC NUMBERS
SIAM J. COMPUT. Vol. 33, No. 6, pp. 338 368 c 004 Society for Industrial and Applied Mathematics GRAPHS WITH TINY VECTOR CHROMATIC NUMBERS AND HUGE CHROMATIC NUMBERS URIEL FEIGE, MICHAEL LANGBERG, AND
More informationThe Algorithmic Aspects of the Regularity Lemma
The Algorithmic Aspects of the Regularity Lemma N. Alon R. A. Duke H. Lefmann V. Rödl R. Yuster Abstract The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in
More informationSpectral Graph Theory Lecture 2. The Laplacian. Daniel A. Spielman September 4, x T M x. ψ i = arg min
Spectral Graph Theory Lecture 2 The Laplacian Daniel A. Spielman September 4, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in class. The notes written before
More informationGraph Theory. Thomas Bloom. February 6, 2015
Graph Theory Thomas Bloom February 6, 2015 1 Lecture 1 Introduction A graph (for the purposes of these lectures) is a finite set of vertices, some of which are connected by a single edge. Most importantly,
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 informationEfficient Approximation for Restricted Biclique Cover Problems
algorithms Article Efficient Approximation for Restricted Biclique Cover Problems Alessandro Epasto 1, *, and Eli Upfal 2 ID 1 Google Research, New York, NY 10011, USA 2 Department of Computer Science,
More informationNP-Hardness reductions
NP-Hardness reductions Definition: P is the class of problems that can be solved in polynomial time, that is n c for a constant c Roughly, if a problem is in P then it's easy, and if it's not in P then
More informationCSC2420 Fall 2012: Algorithm Design, Analysis and Theory Lecture 9
CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Lecture 9 Allan Borodin March 13, 2016 1 / 33 Lecture 9 Announcements 1 I have the assignments graded by Lalla. 2 I have now posted five questions
More informationOn shredders and vertex connectivity augmentation
On shredders and vertex connectivity augmentation Gilad Liberman The Open University of Israel giladliberman@gmail.com Zeev Nutov The Open University of Israel nutov@openu.ac.il Abstract We consider the
More informationA Sublinear Bipartiteness Tester for Bounded Degree Graphs
A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dept. of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot, ISRAEL oded@wisdom.weizmann.ac.il Dana
More information25 Minimum bandwidth: Approximation via volume respecting embeddings
25 Minimum bandwidth: Approximation via volume respecting embeddings We continue the study of Volume respecting embeddings. In the last lecture, we motivated the use of volume respecting embeddings by
More informationBerge Trigraphs. Maria Chudnovsky 1 Princeton University, Princeton NJ March 15, 2004; revised December 2, Research Fellow.
Berge Trigraphs Maria Chudnovsky 1 Princeton University, Princeton NJ 08544 March 15, 2004; revised December 2, 2005 1 This research was partially conducted during the period the author served as a Clay
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 informationThe structure of bull-free graphs II elementary trigraphs
The structure of bull-free graphs II elementary trigraphs Maria Chudnovsky Columbia University, New York, NY 10027 USA May 6, 2006; revised April 25, 2011 Abstract The bull is a graph consisting of a triangle
More informationLecture 10: Hardness of approximating clique, FGLSS graph
CSE 533: The PCP Theorem and Hardness of Approximation (Autumn 2005) Lecture 10: Hardness of approximating clique, FGLSS graph Nov. 2, 2005 Lecturer: Venkat Guruswami and Ryan O Donnell Scribe: Ioannis
More informationTree-width and planar minors
Tree-width and planar minors Alexander Leaf and Paul Seymour 1 Princeton University, Princeton, NJ 08544 May 22, 2012; revised March 18, 2014 1 Supported by ONR grant N00014-10-1-0680 and NSF grant DMS-0901075.
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 informationMath 5707: Graph Theory, Spring 2017 Midterm 3
University of Minnesota Math 5707: Graph Theory, Spring 2017 Midterm 3 Nicholas Rancourt (edited by Darij Grinberg) December 25, 2017 1 Exercise 1 1.1 Problem Let G be a connected multigraph. Let x, y,
More information