Twice-Ramanujan sparsifiers

SIAM Journal on Computing

Volumn 41, Issue 6, 2012, Pages 1704-1721

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Yale University   (United States)

Author keywords

Barrier method; Graph sparsification; Paving conjecture; Rank one updates; Sparse quadratic forms; Spectral graph theory; Spectral sparsification

Indexed keywords

BARRIER METHOD; GRAPH SPARSIFICATION; PAVING CONJECTURE; QUADRATIC FORM; RANK-ONE UPDATES; SPARSIFICATION; SPECTRAL GRAPH THEORY;

COMPUTATION THEORY; GRAPHIC METHODS; NUMBER THEORY; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 84871597376     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090772873     Document Type: Conference Paper

References (20)

1. C. A. AKEMANN AND J. ANDERSON, Lyapunov theorems for operator algebras, Mem. Amer. Math. Soc., 94(1991), 458.
2. N. ALON AND F. CHUNG, Explicit construction of linear sized tolerant networks, Discrete Math., 72(1988), pp. 15-19.
3. 2) time, in Proceedings of the 28th Annual Symposium on the Theory of Computing (STOC'96), 1996, pp. 47-55.
4. J. BOURGAIN AND L. TZAFRIRI, On a problem of Kadison and Singer, J. Reine Angew. Math., 420(1991), pp. 1-43.
5. P. G. CASAZZA AND J. C. TREMAIN, The Kadison-Singer problem in mathematics and engineering, Proc. Natl. Acad. Sci. USA, 103(2006), pp. 2032-2039. (Pubitemid 43271618)
6. P. CHEW, There is a planar graph almost as good as the complete graph, in Proceedings of the Second Annual Symposium on Computational Geometry (SoCG'86), 1986, pp. 169-177.
7. H. DETTE AND W. J. STUDDEN, Some new asymptotic properties for the zeros of Jacobi, Laguerre, and Hermite polynomials, Constr. Approx., 11(1995), pp. 227-238.
8. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
9. N. GOYAL, L. RADEMACHER, AND S. VEMPALA, Expanders via random spanning trees, in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09), 2009, pp. 576-585.
10. S. HOORY, N. LINIAL, AND A. WIGDERSON, Expander graphs and their applications, Bull. Amer. Math. Soc., 43(2006), pp. 439-561. (Pubitemid 44448254)
11. R. KHANDEKAR, S. RAO, AND U. VAZIRANI, Graph partitioning using single commodity flows, in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC'06), 2006, pp. 385-390. (Pubitemid 44306573)
12. A. LUBOTZKY, R. PHILLIPS, AND P. SARNAK, Ramanujan graphs, Combinatorica, 8(1988), pp. 261-277.
13. G. A. MARGULIS, Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators, Probl. Inf. Transm., 24(1988), pp. 39-46. (Pubitemid 20679437)
14. A. NILLI, On the second eigenvalue of a graph, Discrete Math., 91(1991), pp. 207-210.
15. M. RUDELSON, Random vectors in the isotropic position, J. Funct. Anal., 163(1999), pp. 60-72.
16. D. A. SPIELMAN AND N. SRIVASTAVA, Graph sparsification by effective resistances, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC'08), 2008, pp. 563-568.
17. D. A. SPIELMAN AND S.-H. TENG, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC'04), 2004, pp. 81-90.
18. D. A. SPIELMAN AND S.-H. TENG, Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems, CoRR, abs/cs/0607105, 2008; available online at http://www.arxiv.org/abs/cs. NA/0607105.
19. D. A. SPIELMAN AND S.-H. TENG, Spectral Sparsification of Graphs, CoRR, abs/0808.4134, 2008; available online at http://arxiv.org/abs/0808.4134.
20. N. WEAVER, The Kadison-Singer problem in discrepancy theory, Discrete Math., 278(2004), pp. 227-239.