NDLI: An Expansion Tester for Bounded Degree Graphs

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Kale, Satyen Seshadhri, C.
Copyright Year	2011
Abstract	We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [O. Goldreich and D. Ron, On Testing Expansion in Bounded-Degree Graphs, Technical report TR00-020, ECCC, Potsdam, Germany, 2000]. We give a property tester that takes as input a graph with degree bound d, an expansion bound $\alpha$, and a parameter $\varepsilon>0$. The tester accepts the graph with high probability if its expansion is more than $\alpha$, and rejects it with high probability if it is $\varepsilon$-far from any graph with expansion $\alpha'$ with degree bound d, where $\alpha'<\alpha$ is a function of $\alpha$. 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 $\widetilde{O}(\frac{n^{(1+\mu)/2}d^2}{\varepsilon\alpha^2})$ for any fixed $\mu>0$.
Starting Page	709
Ending Page	720
Page Count	12
File Format	PDF
ISSN	00975397
DOI	10.1137/100802980
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	3 (Special Section on Foundations of Computer Science)
Volume Number	40
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2011-06-09
Access Restriction	Subscribed
Subject Keyword	random walks sublinear algorithms Analysis of algorithms and problem complexity Graph theory graph expansion
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Noise Tolerance of Expanders and Sublinear Expansion Reconstruction

A sublinear bipartite tester for bounded degree graphs (1999)

An expansion tester for bounded degree graphs

An expansion tester for bounded degree graphs

Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile

Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs

An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube

Fast Connected Components Algorithms for the EREW PRAM

A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning

An Expansion Tester for Bounded Degree Graphs

Similar Documents

Noise Tolerance of Expanders and Sublinear Expansion Reconstruction

A sublinear bipartite tester for bounded degree graphs (1999)

An expansion tester for bounded degree graphs

An expansion tester for bounded degree graphs

Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile

Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs

An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube

Fast Connected Components Algorithms for the EREW PRAM

A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning

An Expansion Tester for Bounded Degree Graphs