Approximations for the isoperimetric and spectral profile of graphs and related parameters

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 631-640

  Raghavendra, Prasad ^a   Steurer, David ^b   Tetali, Prasad ^c  

^a MSR New England   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

approximation algorithm; graph expansion; semidefinite programming; small set expansion; sparse principal component analysis; spectral profile

Indexed keywords

DIAGONALLY DOMINANT; EDGE EXPANSION; EFFICIENT ALGORITHM; EIGENVALUE PROBLEM; GRAPH EXPANSION; GRAPH G; LAPLACIAN MATRICES; MARKOV CHAIN; NATURAL GENERALIZATION; PROBABILITY MEASURES; RAYLEIGH QUOTIENTS; SEMI-DEFINITE PROGRAMMING; SMALL-SET EXPANSION; SPECTRAL GAP; SPECTRAL PROFILE; UNIQUE GAMES CONJECTURE;

COMPUTATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; EXPANSION; GRAPH THEORY; MARKOV PROCESSES; MATHEMATICAL PROGRAMMING; PRINCIPAL COMPONENT ANALYSIS;

APPROXIMATION ALGORITHMS;

EID: 77954737333     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806776     Document Type: Conference Paper

References (22)

1. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
2. Theory of computing (Singer Island, Fla., 1984).
3. 1, isoperimetric inequalities for graphs, and superconcentrators. J. Combin. Theory Ser. B, 38(1):73-88, 1985.
4. S. Arora and S. Kale. A combinatorial, primal-dual approach to semidefinite programs. In STOC, pages 227-236, 2007.
5. B. Barak, M. Hardt, I. Haviv, A. Rao, O. Regev, and D. Steurer. Rounding parallel repetitions of unique games. In FOCS, pages 374-383, 2008.
6. M. Barlow, T. Coulhon, and A. Grigor'yan. Manifolds and graphs with slow heat kernel decay. Invent. Math., 144:609-649, 2001.
7. M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for unique games. In STOC, pages 205-214, 2006.
8. E. Chlamtac, K. Makarychev, and Y. Makarychev. How to play unique games using embeddings. In FOCS, pages 687-696, 2006.
9. F. Chung. Random walks and local cuts in graphs. Linear Algebra Appl., 423(1):22-32, 2007. (Pubitemid 46413324)
10. F. R. K. Chung. Spectral graph theory, volume 92 of CBMS Regional Conference Series in Mathematics. Published for the Conference Board of the Mathematical Sciences, Washington, DC, 1997.
11. T. Coulhon, Grigor'yan, and C. Pittet. A geometric approach to on-diagonal heat kernel lower bound on groups. Ann. Inst. Fourier, 51:1763-1827, 2001.
12. A. d'Aspremont, F. R. Bach, and L. E. Ghaoui. Full regularization path for sparse principal component analysis. In ICML, pages 177-184, 2007.
13. A. d'Aspremont, F. R. Bach, and L. E. Ghaoui. Optimal solutions for sparse principal component analysis. CoRR, abs/0707.0705, 2007.
14. A. d'Aspremont, L. E. Ghaoui, M. I. Jordan, and G. R. G. Lanckriet. A direct formulation for sparse pca using semidefinite programming. In NIPS, 2004.
15. S. Goel, R. Montenegro, and P. Tetali. Mixing time bounds via the spectral profile. Electron. J. Probab., 11:no. 1, 1-26 (electronic), 2006.
16. L. Lovász and R. Kannan. Faster mixing via average conductance. In Proc. of the Symp. on Theory of Computing, volume 31 of STOC, pages 282-287. ACM, ACM, 1999.
17. R. Montenegro and P. Tetali. Mathematical Aspects of Mixing Times in Markov Chains, volume 1 of Foundations and Trends in Theoretical Computer Science. NOW, Boston-Delft, 2006.
18. B. Morris and Y. Peres. Evolving sets, mixing and heat kernel bounds. Probab. Th. and Related Fields, 133(2):245-266, 2005.
19. P. Raghavendra and D. Steurer. Graph expansion and the unique games conjecture. In STOC, 2010.
20. D. Steurer. Fast SDP algorithms for constraint satisfaction problems. In SODA, 2010. To appear.
21. L. Trevisan. Max cut and the smallest eigenvalue. In STOC, pages 263-272, 2009.
22. H. Zou, T. Hastie, and R. Tibshirani. Sparse principal component analysis. J. Comput. Graph. Statist., 15(2):265-286, 2006.