Testing[Rubinfeld.pptVIP

Testing Expansion in Bounded Degree Graphs Christian Sohler University of Dortmund (joint work with Artur Czumaj, University of Warwick) Testing Expansion in Bounded Degree GraphsIntroduction Property Testing[Rubinfeld, Sudan]: Formal framework to analyze ?Sampling“-algorithms for decision problems Decide with help of a random sample whether a given object has a property or is far away from it Testing Expansion in Bounded Degree GraphsIntroduction Property Testing[Rubinfeld, Sudan]: Formal framework to analyze ?Sampling“-algorithms for decision problems Decide with help of a random sample whether a given object has a property or is far away from it Definition: An object is e-far from a property P, if it differs in more than an e-fraction of ist formal description from any object with property P. Testing Expansion in Bounded Degree GraphsIntroduction Bounded degree graphs Graph (V,E) with degree bound d V={1,…,n} Edges as adjacency lists through function f: V ?{1,…,d} ?V f(v,i) is i-th neighbor of v or ■, if i-th neighbor does not exist Query f(v,i) in O(1) time Testing Expansion in Bounded Degree GraphsIntroduction Definition: A graph (V,E) with degree bound d and n vertices is e-far from a property P, if more than edn entries in the adjacency lists have to be modified to obtain a graph with property P. Example (Bipartiteness): Testing Expansion in Bounded Degree GraphsIntroduction Goal: Accept graphs that have property P with probability at least 2/3 Reject graphs that are e-far from P with probability at least 2/3 Complexity Measure: Query (sample) complexity Running time Testing Expansion in Bounded Degree GraphsIntroduction Definition [Neighborhood] N(U) denotes the neighborhood of U, i.e. N(U) = {v?V-U: ? u?U such that (v,u)?E} Definition [Expander]: A Graph is an a-Expander, if N(U)? a?|U| for each U?V with |U|?|V|/2. Testing Expansion in Bounded Degree GraphsIntroduction Testing Expansion: Accept every graph that is an a-exp