Approximating the expansion profile and almost optimal local graph clustering

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2012, Pages 187-196

  Gharan, Shayan Oveis ^a   Trevisan, Luca ^a  

^a Stanford University   (United States)

Author keywords

Cheeger Inequality; Local Graph Clustering; Small Set Expansion Problem

Indexed keywords

BICRITERIA APPROXIMATION; CHEEGER; CONSTANT FACTORS; FINITE STATE; GRAPH CLUSTERING; GRAPH PARTITIONING ALGORITHMS; LOWER BOUNDS; MIXING TIME; RANDOM WALK; RUNNING TIME; SMALL-SET EXPANSIONS; SPECTRAL PARTITIONING; TECHNICAL TOOLS; TIME ALGORITHMS;

CLUSTERING ALGORITHMS; COMPUTER SCIENCE; EXPANSION; GRAPH THEORY; MARKOV PROCESSES; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS;

EID: 84871993230     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2012.85     Document Type: Conference Paper

References (23)

1. D. A. Spielman and S.-H. Teng, "A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning," CoRR, vol. abs/0809.3232, 2008.
2. R. Andersen, F. R. K. Chung, and K. J. Lang, "Local graph partitioning using pagerank vectors," in FOCS, 2006, pp. 475-486.
3. R. Andersen and Y. Peres, "Finding sparse cuts locally using evolving sets," in STOC, 2009, pp. 235-244.
4. S. Arora, B. Barak, and D. Steurer, "Subexponential algorithms for unique games and related problems," in FOCS, 2010, pp. 563-572.
5. N. Alon and V. Milman, "Isoperimetric inequalities for graphs, and superconcentrators," Journal of Combinatorial Theory, Series B, vol. 38, no. 1, pp. 73-88, feb 1985.
6. N. Alon, "Eigen values and expanders," Combinatorica, vol. 6, pp. 83-96, January 1986.
7. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," Journal of the ACM, vol. 46, pp. 668-677, 1999.
8. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, no. 8, pp. 888-905, 2000.
9. D. A. Tolliver and G. L. Miller, "Graph partitioning by spectral rounding: Applications in image segmentation and clustering," in CVPR, 2006, pp. 1053-1060.
10. L. Orecchia, S. Sachdeva, and N. K. Vishnoi, "Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator," in STOC, 2012.
11. R. Kannan, S. Vempala, and A. Vetta, "On clusterings: Good, bad and spectral," Journal of The ACM, vol. 51, pp. 497-515, 2004.
12. D. A. Spielman and S.-H. Teng, "Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems," in STOC, 2004, pp. 81-90.
13. P. Raghavendra and D. Steurer, "Graph expansion and the unique games conjecture," in STOC, 2010, pp. 755-764.
14. P. Diaconis and J. A. Fill, "Strong stationary times via a new form of duality," Ann. Probab., vol. 18, no. 4, pp. 1483-1522, 1990.
15. L. Lovász and R. Kannan, "Faster mixing via average conductance," in STOC, 1999, pp. 282-287.
16. P. Raghavendra, D. Steurer, and P. Tetali, "Approximations for the isoperimetric and spectral profile of graphs and related parameters," in STOC, 2010, pp. 631-640.
17. N. Bansal, U. Feige, R. Krauthgamer, K. Makarychev, V. Nagarajan, J. Naor, and R. Schwartz, "Min-max graph partitioning and small set expansion." in FOCS, 2011, pp. 17-26.
18. T. C. Kwok and L. C. Lau, "Finding small sparse cuts by random walk," in APPROX-RANDOM, 2012, pp. 615-626.
19. R. O'Donnell and D. Witmer, "Improved small-set expansion from higher eigenvalues," CoRR, vol. abs/1204.4688, 2012.
20. L. Lovász and M. Simonovits, "The mixing rate of markov chains, an isoperimetric inequality, and computing the volume," in FOCS, 1990, pp. 346-354.
21. B. Morris and Y. Peres, "Evolving sets and mixing," in STOC, 2003, pp. 279-286.
22. L. Lovász and M. Simonovits, "Random walks in a convex body and an improved volume algorithm," Random Struct. Algorithms, vol. 4, no. 4, pp. 359-412, 1993.
23. D. Williams, Probability with Martingales (Cambridge Mathematical Textbooks). Cambridge University Press, Feb. 1991.