On testing expansion in bounded-degree graphs

Oded Goldreich; Dana Ron

doi:10.1007/978-3-642-22670-0_9

On testing expansion in bounded-degree graphs

Oded Goldreich^*, Dana Ron

^*Corresponding author for this work

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

73 Scopus citations

Abstract

We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or is far from any graph with such (or related) property. We present a natural algorithm aimed towards achieving the foregoing task. The algorithm is given a (normalized) eigenvalue bound λ < 1, oracle access to a bounded-degree N-vertex graph, and two additional parameters ε,α > 0. The algorithm runs in time N ^0.5+α /poly(ε), and accepts any graph having (normalized) second eigenvalue at most λ. We believe that the algorithm rejects any graph that is ε-far from having second eigenvalue at most λ ^α/O(1), and prove the validity of this belief under an appealing combinatorial conjecture.

Original language	English
Title of host publication	Studies in Complexity and Cryptography
Subtitle of host publication	Miscellanea on the Interplay between Randomness and Computation
Editors	Oded Goldreich
Publisher	Springer Berlin Heidelberg
Pages	68-75
Number of pages	8
ISBN (Print)	9783642226694
DOIs	https://doi.org/10.1007/978-3-642-22670-0_9
State	Published - 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6650 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Keywords

Graph Expansion
Property Testing

Access to Document

10.1007/978-3-642-22670-0_9

Cite this

Goldreich, O., & Ron, D. (2011). On testing expansion in bounded-degree graphs. In O. Goldreich (Ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation (pp. 68-75). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-22670-0_9

Goldreich, Oded ; Ron, Dana. / On testing expansion in bounded-degree graphs. Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. editor / Oded Goldreich. Springer Berlin Heidelberg, 2011. pp. 68-75 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{06769a510d6446a3a6325088a411b0ba,

title = "On testing expansion in bounded-degree graphs",

abstract = "We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or is far from any graph with such (or related) property. We present a natural algorithm aimed towards achieving the foregoing task. The algorithm is given a (normalized) eigenvalue bound λ < 1, oracle access to a bounded-degree N-vertex graph, and two additional parameters ε,α > 0. The algorithm runs in time N 0.5+α /poly(ε), and accepts any graph having (normalized) second eigenvalue at most λ. We believe that the algorithm rejects any graph that is ε-far from having second eigenvalue at most λ α/O(1), and prove the validity of this belief under an appealing combinatorial conjecture.",

keywords = "Graph Expansion, Property Testing",

author = "Oded Goldreich and Dana Ron",

year = "2011",

doi = "10.1007/978-3-642-22670-0_9",

language = "אנגלית",

isbn = "9783642226694",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Berlin Heidelberg",

pages = "68--75",

editor = "Oded Goldreich",

booktitle = "Studies in Complexity and Cryptography",

}

Goldreich, O & Ron, D 2011, On testing expansion in bounded-degree graphs. in O Goldreich (ed.), Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6650 LNCS, Springer Berlin Heidelberg, pp. 68-75. https://doi.org/10.1007/978-3-642-22670-0_9

On testing expansion in bounded-degree graphs. / Goldreich, Oded; Ron, Dana.
Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. ed. / Oded Goldreich. Springer Berlin Heidelberg, 2011. p. 68-75 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6650 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - On testing expansion in bounded-degree graphs

AU - Goldreich, Oded

AU - Ron, Dana

PY - 2011

Y1 - 2011

N2 - We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or is far from any graph with such (or related) property. We present a natural algorithm aimed towards achieving the foregoing task. The algorithm is given a (normalized) eigenvalue bound λ < 1, oracle access to a bounded-degree N-vertex graph, and two additional parameters ε,α > 0. The algorithm runs in time N 0.5+α /poly(ε), and accepts any graph having (normalized) second eigenvalue at most λ. We believe that the algorithm rejects any graph that is ε-far from having second eigenvalue at most λ α/O(1), and prove the validity of this belief under an appealing combinatorial conjecture.

AB - We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or is far from any graph with such (or related) property. We present a natural algorithm aimed towards achieving the foregoing task. The algorithm is given a (normalized) eigenvalue bound λ < 1, oracle access to a bounded-degree N-vertex graph, and two additional parameters ε,α > 0. The algorithm runs in time N 0.5+α /poly(ε), and accepts any graph having (normalized) second eigenvalue at most λ. We believe that the algorithm rejects any graph that is ε-far from having second eigenvalue at most λ α/O(1), and prove the validity of this belief under an appealing combinatorial conjecture.

KW - Graph Expansion

KW - Property Testing

UR - http://www.scopus.com/inward/record.url?scp=84857590925&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-22670-0_9

DO - 10.1007/978-3-642-22670-0_9

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:84857590925

SN - 9783642226694

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 68

EP - 75

BT - Studies in Complexity and Cryptography

A2 - Goldreich, Oded

PB - Springer Berlin Heidelberg

ER -

Goldreich O, Ron D. On testing expansion in bounded-degree graphs. In Goldreich O, editor, Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. Springer Berlin Heidelberg. 2011. p. 68-75. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-22670-0_9

On testing expansion in bounded-degree graphs

Abstract

Publication series

Keywords

Access to Document

Other files and links

Fingerprint

Cite this