Sparse quadratic forms and their geometric applications (after Batson, Spielman and Srivastava)

We survey the work of Batson, Spielman and Srivastava on graph sparsification, and we describe some of its recently discovered geometric applications.

[1]  H. Weyl.  Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung) , 1912 .

[2]  I. J. Schoenberg.  On Certain Metric Spaces Arising From Euclidean Spaces by a Change of Metric and Their Imbedding in Hilbert Space , 1937 .

[3]  J. Wells,et al.  Embeddings and Extensions in Analysis , 1975 .

[4]  Charles M. Newman,et al.  On uncomplemented subspaces ofLp, 1 , 1977 .

[5]  M. Edelstein.  Review: J. H. Wells and L. R. Williams, Embeddings and extensions in analysis , 1977 .

[6]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[7]  G. Schechtman.  More on embedding subspaces of $L_p$ in $l^n_r$ , 1987 .

[8]  J. Bourgain,et al.  Invertibility of ‘large’ submatrices with applications to the geometry of Banach spaces and harmonic analysis , 1987 .

[9]  N. Tomczak-Jaegermann,et al.  On the length of faithful nuclear representations of finite rank operators , 1988 .

[10]  K. Berman,et al.  Matrix norm inequalities and the relative Dixmier property , 1988 .

[11]  M. Talagrand.  Embedding Subspaces of L 1 into l N 1 , 1990 .

[12]  J. Bourgain,et al.  On a problem of Kadison and Singer. , 1991 .

[13]  Noga Alon,et al.  On the second eigenvalue of a graph , 1991, Discret. Math..

[14]  G. Schechtman,et al.  Remarks on Talagrand’s deviation inequality for Rademacher functions , 1990, math/9201208.

[15]  M. Rudelson.  Random Vectors in the Isotropic Position , 1996, math/9608208.

[16]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[17]  J. Matousek,et al.  On embedding expanders into ℓp spaces , 1997 .

[18]  M. Rudelson.  Contact points of convex bodies , 1997 .

[19]  K. Ball.  An elementary introduction to modern convex geometry, in flavors of geometry , 1997 .

[20]  K. Ball.  An Elementary Introduction to Modern Convex Geometry , 1997 .

[21]  R. Vershynin.  John's decompositions: Selecting a large part , 1999, math/9909110.

[22]  Noga Alon,et al.  Problems and results in extremal combinatorics--I , 2003, Discret. Math..

[23]  Shang-Hua Teng,et al.  Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.

[24]  Kenneth Ward Church,et al.  Nonlinear Estimators and Tail Bounds for Dimension Reduction in l1 Using Cauchy Random Projections , 2006, J. Mach. Learn. Res..

[25]  Mark Rudelson,et al.  Sampling from large matrices: An approach through geometric functional analysis , 2005, JACM.

[26]  Nikhil Srivastava,et al.  Graph sparsification by effective resistances , 2008, SIAM J. Comput..

[27]  D. Spielman,et al.  An elementary proof of the restricted invertibility theorem , 2009, 0911.1114.

[28]  P. Casazza,et al.  Revisiting the Bourgain-Tzafriri restricted invertibility theorem , 2009 .

[29]  Joel A. Tropp,et al.  Column subset selection, matrix factorization, and eigenvalue optimization , 2008, SODA.

[30]  R. Adamczak,et al.  Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles , 2009, 0903.2323.

[31]  Nikhil Srivastava,et al.  Twice-ramanujan sparsifiers , 2008, STOC '09.

[32]  Amin Saberi,et al.  Subgraph sparsification and nearly optimal ultrasparsifiers , 2009, STOC '10.

[33]  Assaf Naor,et al.  L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry , 2010, ArXiv.

[34]  D. Spielman,et al.  Spectral sparsification and restricted invertibility , 2010 .

[35]  Assaf Naor,et al.  Towards a calculus for non-linear spectral gaps , 2009, SODA '10.

[36]  N. Srivastava.  On Contact Points of Convex Bodies , 2012 .

[37]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[38]  Shang-Hua Teng,et al.  A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning , 2008, SIAM J. Comput..