Distribution-Free Connectivity Testing

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 algorithms have 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.

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

[2]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[3]  Dana Ron,et al.  Tight Bounds for Testing Bipartiteness in General Graphs , 2004, RANDOM-APPROX.

[4]  Artur Czumaj,et al.  Testing Hypergraph Coloring , 2001, ICALP.

[5]  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..

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

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

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

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

[10]  Luca Trevisan,et al.  Three theorems regarding testing graph properties , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

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

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

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

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

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

[17]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

[18]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).