Abstract
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an expansion bound α, and a parameter ε> 0, accepts the graph with high probability if its expansion is more than α, and rejects it with high probability if it is ε-far from any graph with expansion α′ with degree bound d, where α′ < α is a function of α. For edge expansion, we obtain \(\alpha' = \Omega(\frac{\alpha^2}{d})\), and for vertex expansion, we obtain \(\alpha' = \Omega(\frac{\alpha^2}{d^2})\). In either case, the algorithm runs in time \(\tilde{O}(\frac{n^{(1+\mu)/2}d^2}{\epsilon\alpha^2})\) for any given constant μ> 0.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Fischer, E., Newman, I., Shapira, A.: A Combinatorial Characterization of the Testable Graph Properties: it’s all about Regularity. In: Proc. 38th STOC, pp. 251–260 (2006)
Alon, N., Shapira, A.: A Charaterization of the (Natural) Graph Properties Testable with One-sided Error. In: Proc. 46th FOCS, pp. 429–438 (2005)
Czumaj, A., Sohler, C.: On Testable Properties in Bounded Degree Graphs. In: Proc. 18th SODA, pp. 494–501 (2007)
Czumaj, A., Sohler, C.: Testing Expansion in Bounded Degree Graphs. In: Proc. 48th FOCS, pp. 570–578 (2007)
Fischer, E.: The Art of Uninformed Decisions: A Primer to Property Testing. Bulletin of EATCS 75, 97–126 (2001)
Goldreich, O.: Combinatorial property testing - A survey. In: Randomization Methods in Algorithm Design, pp. 45–60 (1998)
Goldreich, O., Goldwasser, S., Ron, D.: Property Testing and its Connection to Learning and Approximation. J. ACM 45, 653–750 (1998)
Goldreich, O., Ron, D.: Property Testing in Bounded Degree Graphs. Algorithmica 32(2), 302–343 (2002)
Goldreich, O., Ron, D.: A Sublinear Bipartiteness Property Tester for Bounded Degree Graphs. Combinatorica 19(3), 335–373 (1999)
Goldreich, O., Ron, D.: On Testing Expansion in Bounded-Degree Graphs. ECCC, TR00-020 (2000)
Kale, S., Seshadhri, C.: Testing Expansion in Bounded Degree Graphs. ECCC, TR07-076 (2007)
Nachmias, A., Shapira, A.: Testing the Expansion of a Graph ECCC, TR07-118 (2007)
Ron, D.: Property testing. In: Handbook on Randomization, vol. II, pp. 597–649 (2001)
Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25, 647–668 (1996)
Sinclair, A.: Algorithms for Random Generation and Counting: a Markov Chain Approach. Birkhaüser Progress In Theoretical Computer Science Series (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kale, S., Seshadhri, C. (2008). An Expansion Tester for Bounded Degree Graphs. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70575-8_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-70575-8_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70574-1
Online ISBN: 978-3-540-70575-8
eBook Packages: Computer ScienceComputer Science (R0)