Asaf Shapira (Georgia Tech) Joint work with: Arnab Bhattacharyya (MIT) Elena Grigorescu (Georgia Tech) Prasad Raghavendra (Georgia Tech) 1 Testing Odd-Cycle.

Slides:



Advertisements
Similar presentations
Hardness of testing 3- colorability in bounded degree graphs Andrej Bogdanov Kenji Obata Luca Trevisan.
Advertisements

Finding Cycles and Trees in Sublinear Time Oded Goldreich Weizmann Institute of Science Joint work with Artur Czumaj, Dana Ron, C. Seshadhri, Asaf Shapira,
Deterministic vs. Non-Deterministic Graph Property Testing Asaf Shapira Tel-Aviv University Joint work with Lior Gishboliner.
Gillat Kol joint work with Ran Raz Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist.
General Linear Model With correlated error terms  =  2 V ≠  2 I.
On the Density of a Graph and its Blowup Raphael Yuster Joint work with Asaf Shapira.
C&O 355 Mathematical Programming Fall 2010 Lecture 22 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
A UNIFIED FRAMEWORK FOR TESTING LINEAR-INVARIANT PROPERTIES ARNAB BHATTACHARYYA CSAIL, MIT (Joint work with ELENA GRIGORESCU and ASAF SHAPIRA)
Kevin Matulef MIT Ryan O’Donnell CMU Ronitt Rubinfeld MIT Rocco Servedio Columbia.
The Structure of Polyhedra Gabriel Indik March 2006 CAS 746 – Advanced Topics in Combinatorial Optimization.
Christian Sohler | Every Property of Hyperfinite Graphs is Testable Ilan Newman and Christian Sohler.
Artur Czumaj Dept of Computer Science & DIMAP University of Warwick Testing Expansion in Bounded Degree Graphs Joint work with Christian Sohler.
Testing of ‘massively parametrized problems’ - Ilan Newman Haifa University Based on joint work with: Sourav Chakraborty, Eldar Fischer, Shirley Halevi,
The main idea of the article is to prove that there exist a tester of monotonicity with query and time complexity.
Derandomized DP  Thus far, the DP-test was over sets of size k  For instance, the Z-Test required three random sets: a set of size k, a set of size k-k’
Proximity Oblivious Testing Oded Goldreich Weizmann Institute of Science Joint work with Dana Ron.
A second order ordinary differential equation has the general form
Sampling algorithms for l 2 regression and applications Michael W. Mahoney Yahoo Research (Joint work with P. Drineas.
Totally Unimodular Matrices Lecture 11: Feb 23 Simplex Algorithm Elliposid Algorithm.
Proximity Oblivious Testing Oded Goldreich Weizmann Institute of Science Joint work with Dana Ron.
Conditional Regularity and Efficient testing of bipartite graph properties Ilan Newman Haifa University Based on work with Eldar Fischer and Noga Alon.
1 COMPOSITION PCP proof by Irit Dinur Presentation by Guy Solomon.
Michael Bender - SUNY Stony Brook Dana Ron - Tel Aviv University Testing Acyclicity of Directed Graphs in Sublinear Time.
On Proximity Oblivious Testing Oded Goldreich - Weizmann Institute of Science Dana Ron – Tel Aviv University.
EXPANDER GRAPHS Properties & Applications. Things to cover ! Definitions Properties Combinatorial, Spectral properties Constructions “Explicit” constructions.
CSE 421 Algorithms Richard Anderson Lecture 4. What does it mean for an algorithm to be efficient?
1 On the Benefits of Adaptivity in Property Testing of Dense Graphs Joint work with Mira Gonen Dana Ron Tel-Aviv University.
1 Algorithmic Aspects in Property Testing of Dense Graphs Oded Goldreich – Weizmann Institute Dana Ron - Tel-Aviv University.
1 On the Benefits of Adaptivity in Property Testing of Dense Graphs Joint works with Mira Gonen and Oded Goldreich Dana Ron Tel-Aviv University.
Lower Bounds for Property Testing Luca Trevisan U C Berkeley.
Expanders Eliyahu Kiperwasser. What is it? Expanders are graphs with no small cuts. The later gives several unique traits to such graph, such as: – High.
1 Separator Theorems for Planar Graphs Presented by Shira Zucker.
Approximating the Distance to Properties in Bounded-Degree and Sparse Graphs Sharon Marko, Weizmann Institute Dana Ron, Tel Aviv University.
Finding Cycles and Trees in Sublinear Time Oded Goldreich Weizmann Institute of Science Joint work with Artur Czumaj, Dana Ron, C. Seshadhri, Asaf Shapira,
Some 3CNF Properties are Hard to Test Eli Ben-Sasson Harvard & MIT Prahladh Harsha MIT Sofya Raskhodnikova MIT.
Dana Moshkovitz, MIT Joint work with Subhash Khot, NYU.
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
Correlation testing for affine invariant properties on Shachar Lovett Institute for Advanced Study Joint with Hamed Hatami (McGill)
The Effect of Induced Subgraphs on Quasi-randomness Asaf Shapira & Raphael Yuster.
A matrix equation has the same solution set as the vector equation which has the same solution set as the linear system whose augmented matrix is Therefore:
Transitive-Closure Spanner of Directed Graphs Kyomin Jung KAIST 2009 Combinatorics Workshop Joint work with Arnab Bhattacharyya MIT Elena Grigorescu MIT.
Complexity 25-1 Complexity Andrei Bulatov Counting Problems.
Number Theory Project The Interpretation of the definition Andre (JianYou) Wang Joint with JingYi Xue.
Lower Bounds for Property Testing Luca Trevisan U.C. Berkeley.
Testing the independence number of hypergraphs
Property Testing: Sublinear-Time Approximate Decisions Oded Goldreich Weizmann Institute of Science Talk at CTW, July 2013.
1 Quasi-randomness is determined by the distribution of copies of a graph in equicardinal large sets Raphael Yuster University of Haifa.
Artur Czumaj DIMAP DIMAP (Centre for Discrete Maths and it Applications) Computer Science & Department of Computer Science University of Warwick Testing.
Locally Testable Codes and Caylay Graphs Parikshit Gopalan (MSR-SVC) Salil Vadhan (Harvard) Yuan Zhou (CMU)
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
Presented by Alon Levin
Nondeterministic property testing László Lovász Katalin Vesztergombi.
Complexity 24-1 Complexity Andrei Bulatov Counting Problems.
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
Expanders and Ramanujan Graphs Mike Krebs, Cal State LA For slideshow: click “Research and Talks” from
Complexity Theory and Explicit Constructions of Ramsey Graphs Rahul Santhanam University of Edinburgh.
1 Chapter 4 Geometry of Linear Programming  There are strong relationships between the geometrical and algebraic features of LP problems  Convenient.
On Sample Based Testers
Property Testing (a.k.a. Sublinear Algorithms )
Lower Bounds for Property Testing
Dana Ron Tel Aviv University
Finding Cycles and Trees in Sublinear Time
A second order ordinary differential equation has the general form
From dense to sparse and back again: On testing graph properties (and some properties of Oded)
Speaker: Chuang-Chieh Lin National Chung Cheng University
Static Output Feedback and Estimators
Testing k-colorability
The Subgraph Testing Model
Switching Lemmas and Proof Complexity
Locality In Distributed Graph Algorithms
Presentation transcript:

Asaf Shapira (Georgia Tech) Joint work with: Arnab Bhattacharyya (MIT) Elena Grigorescu (Georgia Tech) Prasad Raghavendra (Georgia Tech) 1 Testing Odd-Cycle Freeness of Boolean Functions

Testing Boolean functions 2 Input: Oracle access to a function f is said to be  -far from some property P if we need to modify f on at least  2 n inputs to get a function satisfying P. Examples: Linear functions [BLR93]: Triangle-Freeness: What do tests for these families look like? Check if defining pattern is satisfied on random sample If f in P no violation exists (we accept with prob. 1) If f is far from P there must exist a violation (to test, we need many violations) Triangle-freeness studied by [Green05]

Recap of Arnab’s Talk [BGS10] 3 Testing if a graph contains a certain (induced) sub-graph is fundamental to understanding the testability of graph properties Testing if a Boolean function has an (induced) solution of a system of linear equations, is analogous to the notion of a graph having a certain (induced) sub-graph Approach suggests a characterization of the linear-invariant properties of Boolean functions that are testable

Odd-Cycle Freeness (OCF) 4 Definition: A function is odd-cycle-free (OCF) if for any odd t there exist no x 1,…,x t satisfying Note that we are forbidding solutions to an infinite set of equations. In fact, OCF is the only monotone property defined by forbidding solutions to an infinite set of equations.

Our Main Result 5 Theorem [BGRS11]: OCF is testable with O(1/ ε 2 ) queries. Comments: Improvements from tower of exponential in generic results [BGS10] First family defined by infinitely many constraints that is testable efficiently.

How to test OCF? 6 Alg-1: A graph-test with queries: 1. Pick at random 2. Set 3. Accept iff f restricted to G is OCF. Proof technique: reduce to testing bipartiteness in graphs Alg-2: A subspace-sampling test with poly(1/  ) queries. 1. Pick at random 2. Set 3. Accept iff f restricted to S is OCF. Proof technique: Fourier analysis

The edge sampling test 7 Definition: The Cayley graph of f, denoted C( f ), is defined as Example: Suppose f(1,0) = f(1,1) = 1 and f(0,0) = f(0,1) = 0. (0,0) (0,1) (1,1) (1,0) If we change f(0,1)=1 There is a 1-to-2 n correspondence between “cycles” of f and cycles in C( f ).

The edge sampling test 8 Definition: The Cayley graph of f, denoted C( f ), is defined as V  {0,1} n and E  {( u, v ) | f ( u-v )  1} Observation: f is OCF  C( f ) is bipartite Observation: If f is  -far from OCF, then for any OCF function g, the Cayley graph C( f ) is  -far from the Cayley graph C(g). Not enough to apply a graph test for checking bipartiteness.

The Key Lemma 9 Lemma: If f is  -far from OCF then C( f ) is  /2-far from bipartite. Corollary: This proves correctness of the graph-test Proof: The bipartiteness test of [GGR96,AK02] works as follows: 1. Randomly pick 1/ ε vertices in G 2. Query all edges between them 3. Check if the induced subgraph is bipartite Our graph-test for OCF works on C( f ) as follows: 1. Pick random x 1,…,x 1/  (like picking vertices in C( f )) 2. Query f on all points in (like querying edges in C( f )) 3. Check if they contain an odd-cycle (corresponds to odd cycle in C( f ))

Additional Results 10 Lemma: If f is ε -far from OCF then C( f ) is ε /2-far from bipartite. In fact: f is ε -far from OCF  C( f ) is ε /2-far from bipartite. [GGR96, AdlVKK03] One can estimate the distance of a graph to being bipartite up to an error of  n 2, using O(1/ ε 8 ) queries. Corollary 1 [BGRS11]: (Tolerant Test): One can estimate how far is f from OCF up to an error of  2 n, using O(1/ ε 8 ) queries. Corollary 2 [BGRS11]: One can estimate the smallest Fourier coefficient of f up to an error of , using O(1/ ε 8 ) queries.

Proof of Key Lemma 11 Lemma: If f is  -far from OCF then C( f ) is  /2-far from bipartite. Step 1: A geometric interpretation of OCF Step 2: Expressing OCF in terms of Fourier coefficients of f Step 3: A spectral characterization of OCF

Step 1: Geometric interpretation of OCF 12 Claim: f is OCF iff there exists a half-space that contains no element of support( f ). Corollary: f is ε -far from OCF  every half-space contains at least ε 2 n from support( f ). That is,  support( f )  {x : ax = 0}    2 n H+a H Supp( f )

Step 2: OCF and the Fourier Coefficients 13 Step 1: f is ε -far from OCF iff  a we have  support( f )  {x : ax = 0}    2 n Suppose |support( f )|=  2 n If f is OCF then  a such that support( f )  {x : ax = 1} Hence, If f is ε -far, then  a we have  support( f )  {x : ax = 0}    2 n Hence, Corollary: The distance of f from OCF is

Step 3: A Spectral Characterization 14 Fact: The eigenvalues of the adjacency matrix of C( f ) are Corollary: If f is ε -far from OCF then

Smallest Eigenvalue and Bipartiteness 15 Lemma: If G is d-regular and then G is  /2-far from bipartite Proof: Enough to show that for any set of vertices U, we have Let u denote the characteristic vector of U. Then u T Au=2e(U) But using the fact the G is d-regular, we also have

A Canonical Test? 16 [AFKS01,GT03] If a graph property is testable with q(  ) queries, then it is also testable by a canonical test that samples a set S of q(  ) vertices and inspects the graph induced by S. Note: This gives only a quadratic loss in query-complexity. Open Problem: Is there a canonical test for linear-invariant properties of Boolean functions?

A Canonical Test? 17 Open Problem: Is there an efficient canonical test for linear-invariant properties of Boolean functions? That is, the test should work as follows: Test: Sample a set S of q(  ) points Accept iff f restricted to span(S) satisfies P Note: We can assume that test operates as above [BGS10]. Problem is that k points “span” 2 k points, so this gives an exponential loss in query complexity. Question is can we do it with only a poly loss, as in graphs [GT03].

A Canonical Test for OCF 18 Reminder: The graph-test with queries: 1. Pick at random 2. Set 3. Accept iff f restricted to G is OCF. Theorem [BGRS11]: OCF can be tested with a canonical test with only a poly loss in query complexity: The test: Pick a set S of O(log 1/ ε ) points Check if f restricted to span(S) is OCF

Open Problems 19 Is there an “efficient” canonical tester for linear-invariant and subspace-hereditary properties of Boolean functions: Suppose P is testable with q(  ) queries. Is it then also testable with poly(q(  )) by a canonical test? Lower bounds for testing OCF (better than  (1/  ))

20 Thanks!