Distribution-Free Connectivity Testing for Sparse Graphs

Abstract We consider distribution-free property-testing of graph connectivity. In this setting of property testing, the distance between functions is measured with respect to a fixed but unknown distribution D on the domain, and the testing algorithm has an oracle access to random sampling from the domain according to this distribution D. This notion of distribution-free testing was previously defined, and testers were shown for very few properties. However, no distribution-free property testing algorithm was known for any graph property. We present the first distribution-free testing algorithms for one of the central properties in this area—graph connectivity (specifically, the problem is mainly interesting in the case of sparse graphs). We introduce three testing models for sparse graphs: • A model for bounded-degree graphs, • A model for graphs with a bound on the total number of edges (both models were already considered in the context of uniform distribution testing), and • A model which is a combination of the two previous testing models; i.e., bounded-degree graphs with a bound on the total number of edges. We prove that connectivity can be tested in each of these testing models, in a distribution-free manner, using a number of queries that is independent of the size of the graph. This is done by providing a new analysis to previously known connectivity testers (from “standard”, uniform distribution property-testing) and by introducing some new testers.

[1]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[2]  Eldar Fischer.  On the strength of comparisons in property testing , 2004, Inf. Comput..

[3]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[4]  Artur Czumaj,et al.  Testing hypergraph colorability , 2005, Theor. Comput. Sci..

[5]  Noga Alon,et al.  A characterization of easily testable induced subgraphs , 2004, SODA '04.

[6]  Sanguthevar Rajasekaran.  Handbook of randomized computing , 2001 .

[7]  Noga Alon,et al.  Testing subgraphs in directed graphs , 2004, J. Comput. Syst. Sci..

[8]  Noga Alon,et al.  Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[9]  Oded Goldreich,et al.  Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.

[10]  Ilan Newman.  Testing of function that have small width branching programs , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  Noga Alon,et al.  Testing of clustering , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[12]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[13]  Panos M. Pardalos,et al.  Randomization Methods in Algorithm Design , 1998 .

[14]  Ronitt Rubinfeld.  On the Robustness of Functional Equations , 1999, SIAM J. Comput..

[15]  Ronitt Rubinfeld,et al.  Spot-Checkers , 2000, J. Comput. Syst. Sci..

[16]  Noga Alon,et al.  A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[17]  Guy Kindler,et al.  Testing juntas , 2002, J. Comput. Syst. Sci..

[18]  Ilan Newman.  Testing Membership in Languages that Have Small Width Branching Programs , 2002, SIAM J. Comput..

[19]  Kenji Obata,et al.  A lower bound for testing 3-colorability in bounded-degree graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[20]  Noga Alon,et al.  Testing satisfiability , 2002, SODA '02.

[21]  Yoshiharu Kohayakawa,et al.  Efficient Testing of Hypergraphs , 2002, ICALP.

[22]  Ronitt Rubinfeld,et al.  Self-testing/correcting for polynomials and for approximate functions , 1991, STOC '91.

[23]  Eyal Kushilevitz,et al.  Testing Monotonicity over Graph Products , 2004, ICALP.

[24]  Dana Ron,et al.  Testing the diameter of graphs , 1999, RANDOM-APPROX.

[25]  Eldar Fischer,et al.  Testing of matrix properties , 2001, STOC '01.

[26]  Ronitt Rubinfeld,et al.  Spot-checkers , 1998, STOC '98.

[27]  N. Alon,et al.  Testing triangle-freeness in general graphs , 2006, SODA 2006.

[28]  Dana Ron,et al.  Testing metric properties , 2001, STOC '01.

[29]  Ronitt Rubinfeld,et al.  Monotonicity testing over general poset domains , 2002, STOC '02.

[30]  Noga Alon,et al.  Every monotone graph property is testable , 2005, STOC '05.

[31]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[32]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, Comb..

[33]  Eyal Kushilevitz,et al.  Distribution-Free Property Testing , 2003, RANDOM-APPROX.

[34]  Ronitt Rubinfeld,et al.  Fast approximate PCPs for multidimensional bin-packing problems , 2005, Inf. Comput..

[35]  Dana Ron,et al.  Tight Bounds for Testing Bipartiteness in General Graphs , 2004, SIAM J. Comput..

[36]  Noga Alon,et al.  Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.

[37]  Dana Ron,et al.  Proclaiming Dictators and Juntas or Testing Boolean Formulae , 2001, RANDOM-APPROX.

[38]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[39]  Dana Ron,et al.  Testing Monotonicity , 2000, Comb..

[40]  D. Ron,et al.  Testing membership in parenthesis languages , 2003, Random Struct. Algorithms.

[41]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 1997, STOC.

[42]  Luca Trevisan,et al.  Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[43]  Dana Ron,et al.  Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..