Skip to main content
SpringerLink
Log in

Distribution-Free Connectivity Testing for Sparse Graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

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:

  1. •

    A model for bounded-degree graphs,

  2. •

    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

  3. •

    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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alon, N., Shapira, A.: Testing satisfiability. J. Algorithms 47(2), 87–103 (2003) (also appeared in SODA, pp. 645–654, 2002)

    MATH  MathSciNet  Google Scholar 

  2. Alon, N., Shapira, A.: Testing subgraphs in directed graphs. J. Comput. Syst. Sci. 69(3), 354–382 (2004) (also appeared in STOC, pp. 700–709, 2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alon, N., Shapira, A.: A characterization of easily testable induced subgraphs. SODA, pp. 942–951 (2004)

  4. Alon, N., Shapira, A.: A characterization of the (natural) graph properties testable with one-sided error. FOCS, pp. 429–438 (2005)

  5. Alon, N., Shapira, A.: Every monotone graph property is testable. STOC, pp. 128–137 (2005)

  6. Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. Combinatorica 20(4), 451–476 (2000) (also appeared in FOCS, pp. 656–666, 1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Alon, N., Krivelevich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM J. Comput. 30, 1842–1862 (2001) (also appeared in FOCS, pp. 645–655, 1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of clustering. SIAM J. Discrete Math. 16(3), 393–417 (2003) (also appeared in FOCS, pp. 240–251, 2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing low-degree polynomials over GF(2). RANDOM-APPROX, pp. 188–199 (2003)

  10. Alon, N., Kaufman, T., Krivelevich, M., Ron, D.: Testing triangle-freeness in general graphs. SODA, pp. 279–288 (2006)

  11. Arora, S., Sudan, M.: Improved low-degree testing and its applications. Combinatorica 23(3), 365–426 (2003) (also appeared in STOC, pp. 485–495, 1997)

    Article  MATH  MathSciNet  Google Scholar 

  12. Batu, T., Rubinfeld, R., White, P.: Fast approximation PCPs for multidimensional bin-packing problems. Inf. Comput. 196(1), 42–56 (2005) (also appeared in RANDOM-APPROX, pp. 246–256, 1999)

    Article  MATH  MathSciNet  Google Scholar 

  13. Blum, M., Luby, M., Rubinfeld, R.: Self testing/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47, 549–595 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  14. Bogdanov, A., Obata, K., Trevisan, L.: A lower bound for testing 3-colorability in bounded-degree graphs. FOCS, pp. 93–102 (2002)

  15. Czumaj, A., Sohler, C.: Testing hypergraph colorability. Theor. Comput. Sci. 331(1), 37–52 (2005) (also appeared in ICALP, pp. 493–505, 2001)

    Article  MATH  MathSciNet  Google Scholar 

  16. Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved testing algorithms for monotonicity. RANDOM-APPROX, pp. 97–108 (1999)

  17. Ergün, F., Kannan, S., Kumar, R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. J. Comput. Syst. Sci. 60, 717–751 (2000) (a preliminary version appeared in STOC, 1998)

    Article  Google Scholar 

  18. Fischer, E.: On the strength of comparisons in property testing. Manuscript, available at ECCC TR00-083

  19. Fischer, E.: The art of uninformed decisions: a primer to property testing. Comput. Complex. Column Bull. Eur. Assoc. Theor. Comput. Sci. 75, 97–126 (2001)

    MATH  Google Scholar 

  20. Fischer, E., Newman, I.: Testing of matrix properties. STOC, pp. 286–295 (2001)

  21. Fischer, E., Lehman, E., Newman, I., Raskhodnikova, S., Rubinfeld, R., Samorodnitsky, A.: Monotonicity testing over general poset domains. STOC, pp. 474–483 (2002)

  22. Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. J. Comput. Syst. Sci. 68(4), 753–787 (2004) (also appeared in FOCS, pp. 103–112, 2001)

    Article  MATH  MathSciNet  Google Scholar 

  23. Gemmell, P., Lipton, R., Rubinfeld, R., Sudan, M., Wigderson, A.: Self testing/correcting for polynomials and for approximate functions. J. Comput. Syst. Sci. 47(3), 549–595 (1993) (also appeared in STOC, pp. 32–42, 1991)

    Article  Google Scholar 

  24. Goldreich, O.: Combinatorical property testing—a survey. In: Pardalos, P., Rajasekaran, S., Rolim, J. (eds.) Randomized Methods in Algorithms Design. AMS-DIMACS, pp. 45–61 (1998)

  25. Goldreich, O., Ron, D.: On testing expansion in bounded-degree graphs. Electron. Colloq. Comput. Complex. 7(20) (2000)

  26. Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32(2), 302–343 (2002) (also appeared in STOC, pp. 406–415, 1997)

    Article  MATH  MathSciNet  Google Scholar 

  27. Goldreich, O., Trevisan, L.: Three theorems regarding testing graph properties. Random Struct. Algorithms 23(1), 23–57 (2003) (also appeared in FOCS, pp. 302–317, 2001)

    Article  MATH  MathSciNet  Google Scholar 

  28. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. JACM 45(4), 653–750 (1998) (a preliminary version appeared in FOCS, 1996)

    Article  MATH  MathSciNet  Google Scholar 

  29. Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing monotonicity. Combinatorica 20(3), 301–337 (2000) (a preliminary version appeared in FOCS, 1998)

    Article  MATH  MathSciNet  Google Scholar 

  30. Halevy, S., Kushilevitz, E.: Distribution free property testing. RANDOM-APPROX, pp. 341–353 (2003)

  31. Halevy, S., Kushilevitz, E.: Testing monotonicity over graph products. ICALP, pp. 721–732 (2004)

  32. Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. SIAM J. Comput. 33(6), 1441–1483 (2004) (also appeared in RANDOM-APPROX, pp. 341–353, 2003)

    Article  MATH  MathSciNet  Google Scholar 

  33. Kohayakawa, Y., Nagle, B., Rodl, V.: Efficient testing of hypergraphs. ICALP, pp. 1017–1028 (2002)

  34. Newman, I.: Testing of functions that have small width branching programs. SIAM J. Comput. 31(5), 1557–1570 (2002) (also appeared in FOCS, pp. 251–258, 2000)

    Article  MATH  MathSciNet  Google Scholar 

  35. Parnas, M., Ron, D.: Testing the diameter of graphs. Random Struct. Algorithms 20(2), 165–183 (2002) (also appeared in RANDOM-APPROX, pp. 85–96, 1999)

    Article  MATH  MathSciNet  Google Scholar 

  36. Parnas, M., Ron, D.: Testing metric properties. Inf. Comput. 187(2), 155–195 (2003) (also appeared in STOC, pp. 276–285, 2001)

    Article  MATH  MathSciNet  Google Scholar 

  37. Parnas, M., Ron, D., Samorodnitsky, A.: Proclaiming dictators and juntas or testing boolean formulae. RANDOM-APPROX, pp. 273–284 (2001)

  38. Parnas, M., Ron, D., Rubinfeld, R.: Testing membership in parenthesis languages. Random Struct. Algorithms 22(1), 98–138 (2003) (also appeared in RANDOM-APPROX, pp. 261–272, 2001)

    Article  MATH  MathSciNet  Google Scholar 

  39. Ron, D.: Property testing (a tutorial). In: Rajasekaran, S., Pardalos, P.M., Reif, J.H., Rolin, J.D.P. (eds.) Handbook of Randomized Computing. Kluwer Academic, Dordrecht (2001)

    Google Scholar 

  40. Rubinfeld, R.: Robust functional equations and their applications to program testing. SIAM J. Comput. 28(6), 1972–1997 (1999) (appeared in FOCS, 1994)

    Article  MATH  MathSciNet  Google Scholar 

  41. Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25(2), 252–271 (1996) (first appeared as a technical report, Cornell University, 1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Technion, Haifa, 32000, Israel

    Shirley Halevy & Eyal Kushilevitz

Authors
  1. Shirley Halevy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eyal Kushilevitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shirley Halevy.

Additional information

An extended abstract of this work appeared in the proceedings of RANDOM-APPROX 2004.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Halevy, S., Kushilevitz, E. Distribution-Free Connectivity Testing for Sparse Graphs. Algorithmica 51, 24–48 (2008). https://doi.org/10.1007/s00453-007-9054-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9054-1

Keywords

Search

Navigation