Twice-ramanujan sparsifiers

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 255-262

  Batson, Joshua D ^a,b   Spielman, Daniel A ^c   Srivastava, Nikhil ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Yale University   (United States)

Author keywords

Expander graphs; Spectral graph theory

Indexed keywords

ARBITRARY GRAPHS; COMPLETE GRAPHS; EXPANDER GRAPHS; LAPLACIAN MATRICES; POLYNOMIAL-TIME ALGORITHMS; SPECTRAL GRAPH THEORY; WEIGHTED GRAPH;

COMPUTATION THEORY; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 70350682021     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536451     Document Type: Conference Paper

References (19)

1. C. A. Akemann and J. Anderson. Lyapunov theorems for operator algebras. Mem. Amer. Math. Soc., 94, 1991.
2. Noga Alon and Fan Chung. Explicit construction of linear sized tolerant networks. Discrete Mathematics, 72:15-19, 1988.
3. 2) time. In STOC '96, pages 47-55, 1996.
4. J. Bourgain and L. Tzafriri. On a problem of Kadison and Singer. J. Reine Angew. Math., 420:1-43, 1991.
5. Peter G. Casazza and Janet C. Tremain. The Kadison-Singer problem in mathematics and engineering. Proceedings of the National Academy of Sciences of the United States of America, 103(7):2032-2039, 2006.
6. P. Chew. There is a planar graph almost as good as the complete graph. In SoCG '86, pages 169-177, 1986.
7. G. H. Golub and C. F. Van Loan. Matrix Computations, 3rd. Edition. The Johns Hopkins University Press, Baltimore, MD, 1996.
8. Navin Goyal, Luis Rademacher, and Santosh Vempala. Expanders via random spanning trees. In SODA '09, pages 576-585, 2009.
9. Shlomo Hoory, Nathan Linial, and Avi Wigderson. Expander graphs and their applications. Bulletin of the American Mathematical Society, 43(4):439-561, 2006.
10. Rohit Khandekar, Satish Rao, and Umesh Vazirani. Graph partitioning using single commodity flows. In STOC '06, pages 385-390, 2006.
11. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
12. G. A. Margulis. Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problems of Information Transmission, 24(1):39-46, July 1988.
13. Alon Nilli. On the second eigenvalue of a graph. Discrete Mathematics, 91(2):207-210, 1991.
14. Mark Rudelson. Random vectors in the isotropic position. J. of Functional Analysis, 163(1):60-72, 1999.
15. Daniel A. Spielman and Nikhil Srivastava. Graph sparsification by effective resistances. In STOC '08, pages 563-568, 2008. Full version available at http://arXiv.org/abs/0803.0929.
16. Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC '04, pages 81-90, 2004.
17. Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. CoRR, abs/cs/0607105, 2008. Available at http://www.arxiv.org/abs/cs.NA/ 0607105.
18. Daniel A. Spielman and Shang-Hua Teng. Spectral sparsification of graphs. CoRR, abs/0808.4134, 2008. Available at http://arxiv.org/abs/0808.4134.
19. Nik Weaver. The Kadison-Singer problem in discrepancy theory. Discrete Mathematics, 278(1-3):227 - 239, 2004.