Testing Small Set Expansion in General Graphs
Angsheng Li, Pan Peng

TL;DR
This paper develops property testers for small set expansion in general graphs, providing algorithms with specific query complexities that distinguish graphs with certain expansion properties from those far from them.
Contribution
It introduces new testers for small set expansion with both two-sided and one-sided error, applicable in adjacency list and rotation map models, with explicit complexity bounds.
Findings
Two-sided error tester has complexity O(\u221a{m}\u03c6^{-4}\u00b7 \u03b5^{-2})
One-sided error tester has complexity O(f8(rac{n}{b5^3}) + rac{k}{b5 c6^4})
New rotation map model tester with smaller gap between b5^* and b5
Abstract
We consider the problem of testing small set expansion for general graphs. A graph is a -expander if every subset of volume at most has conductance at least . Small set expansion has recently received significant attention due to its close connection to the unique games conjecture, the local graph partitioning algorithms and locally testable codes. We give testers with two-sided error and one-sided error in the adjacency list model that allows degree and neighbor queries to the oracle of the input graph. The testers take as input an -vertex graph , a volume bound , an expansion bound and a distance parameter . For the two-sided error tester, with probability at least , it accepts the graph if it is a -expander and rejects the graph if it is -far from any -expander, where…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Algorithms and Data Compression
