Earthmover resilience & testing in ordered structures
|
|
- Oscar Perry
- 6 years ago
- Views:
Transcription
1 Earthmover resilience & testing in ordered structures Omri Ben-Eliezer Tel-Aviv University Eldar Fischer Technion Computational Complexity Conference 28 UCSD, San Diago
2 Property testing (RS96, GGR98) Meta problem: Given property P, efficiently distinguish between Objects that satisfy P Objects that are far from satisfying P
3 Graph property testing Definition: An!-test for a property P is given query access to an unknown graph G on n vertices, and acts as follows. " satis'ies ) G is!-far from P ACCEPT (with prob. 2/3) DON T CARE REJECT (with prob. 2/3)
4 Graph property testing Query = Is there an edge between u and v? (dense graph model) " satis'ies ) G is!-far from P ACCEPT (with prob. 2/3) DON T CARE REJECT (with prob. 2/3)
5 Graph property testing!-far = need to add/remove!" # edges in G to satisfy P. (dense graph model) $ satis)ies + G is!-far from P ACCEPT (with prob. 2/3) DON T CARE REJECT (with prob. 2/3)
6 Graph property testing Definition: A property P is testable if it has an!-test making "! queries for any! >. Question (GGR98): Which graph properties are testable?
7 Canonical tests An!-test is canonical if it queries a random induced subgraph and accepts/rejects only based on queried subgraph.
8 Canonical tests Theorem [AFKS, GT3]: P testable ó P canonically testable Intuition: Original test makes! queries Canonical test picks random 2! vertices, then simulates original test
9 Tolerant testing [PRR 6] Test is!, # -tolerant ( & < () if it acts as follows. Motivation: Noisy input ) satis.ies G is δ close to P G is #-far from P ACCEPT (with prob. 2/3) DON T CARE REJECT (with prob. 2/3)
10 Tolerant testing [PRR 6] P is tolerantly testable " $ : P has a $, & -test making '(&) queries. + satisies 2 G is δ close to P G is *-far from P ACCEPT (with prob. 2/3) DON T CARE REJECT (with prob. 2/3)
11 Distance estimation P is estimable " # : P has a " #, " -test making &(#, ") queries. G is () *) close to P G is )-far from P ACCEPT (with prob. 2/3) DON T CARE REJECT (with prob. 2/3)
12 Testing vs tolerant testing vs distance estimation Theorem [Fischer, Newman 5]: For graph properties, P canonically testable P estimable " satis'ies ) G is!-far from P G is (! δ) close to P G is!-far from P ACCEPT DON T CARE REJECT ACCEPT DON T CARE REJECT
13 Summary - graph properties testability canonical testability trivial " satis'ies ) G is!-far from P (GT3) " satis'ies ) G is!-far from P ACCEPT DON T CARE REJECT ACCEPT DON T CARE REJECT estimability tolerant testability (FN5) G (! δ) close to P G is!-far from P (FN5) G δ close to P G is!-far from P ACCEPT DON T CARE REJECT ACCEPT DON T CARE REJECT
14 What about ordered structures? Strings (D) Images (2D) AKA ordered matrices Vertex-ordered graphs (2D) and hypergraphs Hypercube (high-d): a different story...
15 Image property testing Unknown!! image # over fixed set of pixels Σ Query = What is the color of pixel in location (i,j)? # satis*ies, # is %-far from P ACCEPT (with prob. 2/3) DON T CARE REJECT (with prob. 2/3)
16 Image property testing Unknown!! image # over fixed set of pixels Σ %-far = need to modify %& ' pixels in # to satisfy P # satis,ies. # is %-far from P ACCEPT (with prob. 2/3) DON T CARE REJECT (with prob. 2/3)
17 Image property testing canonical test = pick randomly! rows and! columns, query all pixels in intersection. queried pixel
18 String property testing Query access to unknown string of length! over fixed alphabet Σ. canonical test = pick randomly # elements and query them. queried element
19 What about ordered structures? Do similar characterizations hold for ordered structures? No, testability/estimability canonical testability Example: not containing three consecutive -s in / strings. No, testability tolerant testability. [Fischer, Fortnow 5] Properties based on codes & PCPPs. Yes, for global enough properties. [This work]
20 Earthmover resilience (strings) Flip operation: Flip locations of neighboring entries Definition: Earthmover distance between strings S and S is! " #, # % = ' () min{ number of flips to create S from S, } Definition: Property P is earthmover resilient if -:, (,) s.t. String # satisfies P String # A B, B % -(D) String # is D-close to P
21 Earthmover resilience (images) Flip operation: Flip locations of neighboring rows/columns Definition: Earthmover distance between images! and! is # $ %, % = ( )* min{ number of flips to create! from!, } Definition: Property P is earthmover resilient if.:, (,) s.t. image % satisfies P image % satisfies Image % is B-close to P
22 Which properties are earthmover resilient? All unordered graph properties [trivial] All hereditary properties of strings, images & ordered graphs [AKNS, ABF7] Global visual properties of images Convexity of the s s form a half plane [This work]: In general, all properties with sparse boundary between s and s. Convex shape of s Monotonicity: a hereditary property
23 Earthmover resilience vs canonical testing [This work]: For string properties P, P earthmover resilient P canonically testable For image and ordered graph properties P, P earthmover resilient P tolerantly testable P canonically testable
24 Canonical testing to estimation [This work]: For image and ordered graph properties P, P canonically testable P (canonically) estimable Corollary [ABF7 + This work]: P hereditary P (canonically) estimable
25 ER properties are similar to graph properties For earthmover resilient properties of images / ordered graphs: Tolerant testability estimability Canonical testability
26 Warmup proof: ER canonical testing in binary strings ER => piecewise canonical testing Consider Interval partition of string into sufficiently many parts. In each interval, make sufficiently many random queries to estimate number of s and s. Due to ER, this gives good estimate for distance to P:!"#$%&'( ), + min 3 VD(S, S8 ) Where VD(S,S ) denotes average variation distance between the distributions of s and s in each interval.
27 Warmup proof: ER canonical testing in binary strings piecewise canonical testing => canonical testing Interval partition can be approximated by Picking sufficiently many random queries. Partitioning them artificially into intervals. Consequently, piecewise canonical tests can be simulated by canonical ones.
28 Bits from the proof: Szemerédi regularity lemma [Szemerédi 75]: Any graph has an equipartition of size!(#), so that almost all pairs of parts are #-regular. density D Pair is '-regular if ( * # for any pair of subsets of size #& Size #& Size N density d Size #& Size N
29 Bits from the proof: canonical testing --> estimation High level idea - unordered case [Fischer Newman 5] Step : If P is canonically testable, densities of small induced subgraphs among graphs satisfying P different from those of graphs far from P. Step 2: regular partitions of graphs satisfying P differ from graphs far from P.
30 Bits from the proof: canonical testing --> estimation High level idea - unordered case [Fischer Newman 5] Step : If P is canonically testable, densities of small induced subgraphs among graphs satisfying P different from those of graphs far from P. Step 2: regular partitions of graphs satisfying P differ from graphs far from P. Step 3: Estimating which regular partitions a graph has - doable with constant number of queries. Step 4: distance of G from P min distance of a regular partition for G from a regular partition for P.
31 Bits from the proof: canonical testing --> estimation Our observation Above scheme essentially works for multipartite graphs. Given ordered graph!, take interval partition of the vertices, effectively approximating! by a multipartite graph.
32 Bonus: Regular reducibility [Alon, Fischer, Newman, Shapira 6]: A graph property P is canonically testable P can be described using regular partitions [This work]: Same holds for images and ordered graphs.
33 Towards a limit object? Proofs in [ABF 7] and this work rely on interval partitioning. A limit object (graphon-like [BCLSSV5; LS8; BCLSV8]) for images and ordered graphs via interval partitioning?
34 Other open questions Testability + earthmover resilience canonical testability? More efficient conversions from testability to estimability Hereditary properties in graphs [Hoppen, Kohayakawa, Lang, Lefmann, Stagni 6 + 7] The landscape of property testing Global properties seem easy to test [AFKS, FN, ABF 7, this work] Local properties are easy to test [BKR 7, B 8+] Algebraic structure makes it hard to test [FF 5, FPS 7] Other general results?
Testing Hereditary Properties of Ordered Graphs and Matrices
Testing Hereditary Properties of Ordered Graphs and Matrices Noga Alon, Omri Ben-Eliezer, Eldar Fischer April 6, 2017 Abstract We consider properties of edge-colored vertex-ordered graphs, i.e., graphs
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 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 informationTesting of bipartite graph properties
Testing of bipartite graph properties Noga Alon Eldar Fischer Ilan Newman June 15, 2005 Abstract Alon et. al. [3], showed that every property that is characterized by a finite collection of forbidden induced
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 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 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 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 Separation Theorem in Property Testing
A Separation Theorem in Property Testing Noga Alon Asaf Shapira Abstract Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter ɛ in advance?
More informationHardness and Algorithms for Rainbow Connection
Hardness and Algorithms for Rainbow Connection Sourav Chakraborty Eldar Fischer Arie Matsliah Raphael Yuster Abstract An edge-colored graph G is rainbow connected if any two vertices are connected by a
More informationHARDNESS AND ALGORITHMS FOR RAINBOW CONNECTIVITY
HARDNESS AND ALGORITHMS FOR RAINBOW CONNECTIVITY SOURAV CHAKRABORTY 1 AND ELDAR FISCHER 1 AND ARIE MATSLIAH 2 AND RAPHAEL YUSTER 3 1 Department of Computer Science, Technion, Haifa 32000, Israel. E-mail
More informationLecture 13: 04/23/2014
COMS 6998-3: 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,
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 informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
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 informationarxiv: v2 [math.co] 11 Mar 2008
Testing properties of graphs and functions arxiv:0803.1248v2 [math.co] 11 Mar 2008 Contents László Lovász Institute of Mathematics, Eötvös Loránd University, Budapest and Balázs Szegedy Department of Mathematics,
More informationOn an Extremal Hypergraph Problem of Brown, Erdős and Sós
On an Extremal Hypergraph Problem of Brown, Erdős and Sós Noga Alon Asaf Shapira Abstract Let f r (n, v, e) denote the maximum number of edges in an r-uniform hypergraph on n vertices, which does not contain
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 informationDeleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays Omri Ben-Eliezer 1, Simon Korman 2, and Daniel Reichman 3 1 Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel
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 informationPigeonhole Principle and Ramsey Theory
Pigeonhole Principle and Ramsey Theory The Pigeonhole Principle (PP) has often been termed as one of the most fundamental principles in combinatorics. The familiar statement is that if we have n pigeonholes
More informationTolerant Versus Intolerant Testing for Boolean Properties
Tolerant Versus Intolerant Testing for Boolean Properties Eldar Fischer Faculty of Computer Science Technion Israel Institute of Technology Technion City, Haifa 32000, Israel. eldar@cs.technion.ac.il Lance
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 informationTolerant Versus Intolerant Testing for Boolean Properties
Electronic Colloquium on Computational Complexity, Report No. 105 (2004) Tolerant Versus Intolerant Testing for Boolean Properties Eldar Fischer Lance Fortnow November 18, 2004 Abstract A property tester
More informationHomomorphism Testing
Homomorphism Shpilka & Wigderson, 2006 Daniel Shahaf Tel-Aviv University January 2009 Table of Contents 1 2 3 1 / 26 Algebra Definitions 1 Algebra Definitions 2 / 26 Groups Algebra Definitions Definition
More informationRAMSEY THEORY. 1 Ramsey Numbers
RAMSEY THEORY 1 Ramsey Numbers Party Problem: Find the minimum number R(k, l) of guests that must be invited so that at least k will know each other or at least l will not know each other (we assume that
More informationDeleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays Omri Ben-Eliezer Simon Korman Daniel Reichman March 27, 2017 Abstract Understanding the local behaviour of structured multi-dimensional
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 informationSpace Complexity vs. Query Complexity
Space Complexity vs. Query Complexity Oded Lachish Ilan Newman Asaf Shapira Abstract Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and
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 informationCombinatorial Optimization
Combinatorial Optimization Problem set 8: solutions 1. Fix constants a R and b > 1. For n N, let f(n) = n a and g(n) = b n. Prove that f(n) = o ( g(n) ). Solution. First we observe that g(n) 0 for all
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 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 informationEcient testing of large graphs. Abstract. to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or
Ecient testing of large graphs Noga Alon y Eldar Fischer z Michael Krivelevich x Mario Szegedy { Abstract Let P be a property of graphs. An -test for P is a randomized algorithm which, given the ability
More informationTesting Expansion in Bounded-Degree Graphs
Testing Expansion in Bounded-Degree Graphs Artur Czumaj Department of Computer Science University of Warwick Coventry CV4 7AL, UK czumaj@dcs.warwick.ac.uk Christian Sohler Department of Computer Science
More informationProclaiming Dictators and Juntas or Testing Boolean Formulae
Proclaiming Dictators and Juntas or Testing Boolean Formulae Michal Parnas The Academic College of Tel-Aviv-Yaffo Tel-Aviv, ISRAEL michalp@mta.ac.il Dana Ron Department of EE Systems Tel-Aviv University
More informationLinear Secret-Sharing Schemes for Forbidden Graph Access Structures
Linear Secret-Sharing Schemes for Forbidden Graph Access Structures Amos Beimel 1, Oriol Farràs 2, Yuval Mintz 1, and Naty Peter 1 1 Ben Gurion University of the Negev, Be er Sheva, Israel 2 Universitat
More informationTEL AVIV UNIVERSITY THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING. The Zandman-Slaner Graduate School of Engineering
ס TEL AVIV UNIVERSITY THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING The Zandman-Slaner Graduate School of Engineering TOPICS IN PROPERTY TESTING AND SUBLINEAR ALGORITHMS By Gilad Tsur THESIS SUBMITTED
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 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 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 informationATLANTA LECTURE SERIES In Combinatorics and Graph Theory (XIX)
ATLANTA LECTURE SERIES In Combinatorics and Graph Theory (XIX) April 22-23, 2017 GEORGIA STATE UNIVERSITY Department of Mathematics and Statistics Sponsored by National Security Agency and National Science
More informationTEL AVIV UNIVERSITY THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING Department of Electrical Engineering - Systems
TEL AVIV UNIVERSITY THE IBY AND ALADAR FLEISCHMAN FACULTY OF ENGINEERING Department of Electrical Engineering - Systems APPROXIMATING THE DISTANCE TO MONOTONICITY AND CONVEXITY IN SUBLINEAR TIME Thesis
More informationProperly Colored Subgraphs and Rainbow Subgraphs in Edge-Colorings with Local Constraints
Properly Colored Subgraphs and Rainbow Subgraphs in Edge-Colorings with Local Constraints Noga Alon, 1, * Tao Jiang, 2, Zevi Miller, 2 Dan Pritikin 2 1 Department of Mathematics, Sackler Faculty of Exact
More informationStatistical Inference on Large Contingency Tables: Convergence, Testability, Stability. COMPSTAT 2010 Paris, August 23, 2010
Statistical Inference on Large Contingency Tables: Convergence, Testability, Stability Marianna Bolla Institute of Mathematics Budapest University of Technology and Economics marib@math.bme.hu COMPSTAT
More informationReed-Muller testing and approximating small set expansion & hypergraph coloring
Reed-Muller testing and approximating small set expansion & hypergraph coloring Venkatesan Guruswami Carnegie Mellon University (Spring 14 @ Microsoft Research New England) 2014 Bertinoro Workshop on Sublinear
More informationSeparating Hierarchical and General Hub Labelings
Separating Hierarchical and General Hub Labelings Andrew V. Goldberg 1 Ilya Razenshteyn 2 Ruslan Savchenko 3 1 Microsoft Research Silicon Valley 2 CSAIL, MIT 3 Moscow State University June 23, 2013 Overview
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
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 informationOblivious and Adaptive Strategies for the Majority and Plurality Problems
Oblivious and Adaptive Strategies for the Majority and Plurality Problems Fan Chung 1, Ron Graham 1, Jia Mao 1, and Andrew Yao 2 1 Department of Computer Science and Engineering, University of California,
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 informationTwo Decades of Property Testing
Two Decades of Property Testing Madhu Sudan Microsoft Research 12/09/2014 Invariance in Property Testing @MIT 1 of 29 Kepler s Big Data Problem Tycho Brahe (~1550-1600): Wished to measure planetary motion
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 informationTutorial: Locally decodable codes. UT Austin
Tutorial: Locally decodable codes Anna Gál UT Austin Locally decodable codes Error correcting codes with extra property: Recover (any) one message bit, by reading only a small number of codeword bits.
More informationTesting Equality in Communication Graphs
Electronic Colloquium on Computational Complexity, Report No. 86 (2016) Testing Equality in Communication Graphs Noga Alon Klim Efremenko Benny Sudakov Abstract Let G = (V, E) be a connected undirected
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 informationOn star forest ascending subgraph decomposition
On star forest ascending subgraph decomposition Josep M. Aroca and Anna Lladó Department of Mathematics, Univ. Politècnica de Catalunya Barcelona, Spain josep.m.aroca@upc.edu,aina.llado@upc.edu Submitted:
More informationLecture 22: Counting
CS 710: Complexity Theory 4/8/2010 Lecture 22: Counting Instructor: Dieter van Melkebeek Scribe: Phil Rydzewski & Chi Man Liu Last time we introduced extractors and discussed two methods to construct them.
More informationColoring Simple Hypergraphs
Department of Mathematics, Statistics and Computer Science University of Illinois Chicago August 28, 2010 Problem Let n 2 and suppose that S [n] [n] with S 2n 1. Then some three points in S determine a
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 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 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 informationRigidity of Graphs and Frameworks
Rigidity of Graphs and Frameworks Rigid Frameworks The Rigidity Matrix and the Rigidity Matroid Infinitesimally Rigid Frameworks Rigid Graphs Rigidity in R d, d = 1,2 Global Rigidity in R d, d = 1,2 1
More informationOn the efficient approximability of constraint satisfaction problems
On the efficient approximability of constraint satisfaction problems July 13, 2007 My world Max-CSP Efficient computation. P Polynomial time BPP Probabilistic Polynomial time (still efficient) NP Non-deterministic
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 informationOn graphs decomposable into induced matchings of linear sizes
On graphs decomposable into induced matchings of linear sizes Jacob Fox Hao Huang Benny Sudakov Abstract We call a graph G an (r, t)-ruzsa-szemerédi graph if its edge set can be partitioned into t edge-disjoint
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 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 informationSeparation Dimension and Sparsity
Separation Dimension and Sparsity Noga Alon 1, Manu Basavaraju, L. Sunil Chandran 3, Rogers Mathew 4, and Deepak Rajendraprasad 5 1 Sackler School of Mathematics and Blavatnik School of Computer Science,
More informationSpace Complexity vs. Query Complexity
Space Complexity vs. Query Complexity Oded Lachish 1, Ilan Newman 2, and Asaf Shapira 3 1 University of Haifa, Haifa, Israel, loded@cs.haifa.ac.il. 2 University of Haifa, Haifa, Israel, ilan@cs.haifa.ac.il.
More informationMa/CS 6b Class 25: Error Correcting Codes 2
Ma/CS 6b Class 25: Error Correcting Codes 2 By Adam Sheffer Recall: Codes V n the set of binary sequences of length n. For example, V 3 = 000,001,010,011,100,101,110,111. Codes of length n are subsets
More information< k 2n. 2 1 (n 2). + (1 p) s) N (n < 1
List of Problems jacques@ucsd.edu Those question with a star next to them are considered slightly more challenging. Problems 9, 11, and 19 from the book The probabilistic method, by Alon and Spencer. Question
More informationOptimal Parity Edge-Coloring of Complete Graphs
Optimal Parity Edge-Coloring of Complete Graphs David P. Bunde, Kevin Milans, Douglas B. West, Hehui Wu Abstract A parity walk in an edge-coloring of a graph is a walk along which each color is used an
More informationTheorem (Special Case of Ramsey s Theorem) R(k, l) is finite. Furthermore, it satisfies,
Math 16A Notes, Wee 6 Scribe: Jesse Benavides Disclaimer: These notes are not nearly as polished (and quite possibly not nearly as correct) as a published paper. Please use them at your own ris. 1. Ramsey
More informationData Mining and Matrices
Data Mining and Matrices 08 Boolean Matrix Factorization Rainer Gemulla, Pauli Miettinen June 13, 2013 Outline 1 Warm-Up 2 What is BMF 3 BMF vs. other three-letter abbreviations 4 Binary matrices, tiles,
More informationApproximating MAX-E3LIN is NP-Hard
Approximating MAX-E3LIN is NP-Hard Evan Chen May 4, 2016 This lecture focuses on the MAX-E3LIN problem. We prove that approximating it is NP-hard by a reduction from LABEL-COVER. 1 Introducing MAX-E3LIN
More informationDelsarte s linear programming bound
15-859 Coding Theory, Fall 14 December 5, 2014 Introduction For all n, q, and d, Delsarte s linear program establishes a series of linear constraints that every code in F n q with distance d must satisfy.
More informationHomework #1. Denote the sum we are interested in as To find we subtract the sum to find that
Homework #1 CMSC351 - Spring 2013 PRINT Name : Due: Feb 12 th at the start of class o Grades depend on neatness and clarity. o Write your answers with enough detail about your approach and concepts used,
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationCS151 Complexity Theory. Lecture 6 April 19, 2017
CS151 Complexity Theory Lecture 6 Shannon s counting argument frustrating fact: almost all functions require huge circuits Theorem (Shannon): With probability at least 1 o(1), a random function f:{0,1}
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationTesting Distributions Candidacy Talk
Testing Distributions Candidacy Talk Clément Canonne Columbia University 2015 Introduction Introduction Property testing: what can we say about an object while barely looking at it? P 3 / 20 Introduction
More informationInvariance in Property Testing
Invariance in Property Testing Madhu Sudan Microsoft Research Based on: works with/of Eli Ben-Sasson, Elena Grigorescu, Tali Kaufman, Shachar Lovett, Ghid Maatouk, Amir Shpilka. February 22, 2012 Invariance
More informationA note on general sliding window processes
A note on general sliding window processes Noga Alon Ohad N. Feldheim September 19, 214 Abstract Let f : R k [r] = {1, 2,..., r} be a measurable function, and let {U i } i N be a sequence of i.i.d. random
More informationEPTAS for Maximum Clique on Disks and Unit Balls
EPTAS for Maximum Clique on Disks and Unit Balls Édouard Bonnet joint work with Panos Giannopoulos, Eunjung Kim, Paweł Rzążewski, and Florian Sikora and Marthe Bonamy, Nicolas Bousquet, Pierre Chabit,
More informationThe Removal Lemma for Tournaments
The Removal Lemma for Tournaments Jacob Fox Lior Gishboliner Asaf Shapira Raphael Yuster August 8, 2017 Abstract Suppose one needs to change the direction of at least ɛn 2 edges of an n-vertex tournament
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 informationTesting Odd-Cycle-Freeness in Boolean Functions
Testing Odd-Cycle-Freeness in Boolean Functions Arnab Bhattacharyya Elena Grigorescu Prasad Raghavendra Asaf Shapira Abstract A function f : F n {0, 1} is odd-cycle-free if there are no x 1,..., x k F
More informationA Characterization of Easily Testable Induced Subgraphs
A Characterization of Easily Testable Induced Subgraphs Extended Abstract Noga Alon Asaf Shapira September 10, 2003 Abstract Let H be a fixed graph on h vertices. We say that a graph G is induced H-free
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 information18.5 Crossings and incidences
18.5 Crossings and incidences 257 The celebrated theorem due to P. Turán (1941) states: if a graph G has n vertices and has no k-clique then it has at most (1 1/(k 1)) n 2 /2 edges (see Theorem 4.8). Its
More informationA class of heuristics for the constrained forest problem
Discrete Applied Mathematics 154 (2006) 6 14 www.elsevier.com/locate/dam Communication A class of heuristics for the constrained forest problem Michael Laszlo, Sumitra Mukherjee Nova Southeastern University,
More informationQuantum Computing Lecture 8. Quantum Automata and Complexity
Quantum Computing Lecture 8 Quantum Automata and Complexity Maris Ozols Computational models and complexity Shor s algorithm solves, in polynomial time, a problem for which no classical polynomial time
More informationThe Effect of Induced Subgraphs on Quasi-Randomness
The Effect of Induced Subgraphs on Quasi-Randomness Asaf Shapira Raphael Yuster Abstract One of the main questions that arise when studying random and quasi-random structures is which properties P are
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 informationNon-Approximability Results (2 nd part) 1/19
Non-Approximability Results (2 nd part) 1/19 Summary - The PCP theorem - Application: Non-approximability of MAXIMUM 3-SAT 2/19 Non deterministic TM - A TM where it is possible to associate more than one
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 informationOn Computing Boolean Connectives of Characteristic Functions
On Computing Boolean Connectives of Characteristic Functions Richard Chang Computer Science Department Cornell University Ithaca, NY 14853 Jim Kadin Computer Science Department University of Maine Orono,
More informationTesting Odd-Cycle-Freeness in Boolean Functions
Testing Odd-Cycle-Freeness in Boolean Functions Arnab Bhattacharyya Elena Grigorescu Prasad Raghavendra Asaf Shapira Abstract A function f : F n {0, 1} is odd-cycle-free if there are no x 1,..., x k F
More informationOptimal Strong Parity Edge-Coloring of Complete Graphs
Optimal Strong Parity Edge-Coloring of Complete Graphs David P. Bunde, Kevin Milans, Douglas B. West, Hehui Wu Abstract A parity walk in an edge-coloring of a graph is a walk along which each color is
More information