Graphs, vectors, and matrices

DOI10.1090/BULL/1557zbMATH Open1351.05146OpenAlexW2512660006MaRDI QIDQ3178747FDOQ3178747

Authors Daniel A. Spielman 

Publication date 20 December 2016

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/bull/1557

zbMATH Keywords

Kadison-Singer problemsparsification of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Density (toughness, etc.) (05C42)

Recommendations

• The solution of the Kadison-Singer problem
• Ramanujan graphs and the solution of the Kadison-Singer problem
• The Kadison-Singer problem
• The Kadison-Singer problem (after A. Marcus, D. Spielman and N. Srivastava)
• Consequences of the Marcus/Spielman/Srivastava solution of the Kadison-Singer problem

Cites Work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3337135 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A Spectral Algorithm for Seriation and the Consecutive Ones Problem
• A proof of Alon’s second eigenvalue conjecture and related problems
• An r-Dimensional Quadratic Placement Algorithm
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
• Existence and Construction of Edge-Disjoint Paths on Expander Graphs
• Expander graphs and their applications
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Extensions of Pure States
• Graph sparsification by effective resistances
• How to Draw a Graph
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
• Isoperimetric inequalities and Markov chains
• Lyapunov theorems for operator algebras
• Matchings and walks in graphs
• Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems
• On the second eigenvalue of a graph
• Ramanujan graphs
• Ramanujan graphs and the solution of the Kadison-Singer problem
• Random vectors in the isotropic position
• Sparse quadratic forms and their geometric applications [following Batson, Spielman, and Srivastava].
• Spectral sparsification of graphs
• Splitting an Expander Graph
• The Kadison-Singer problem in discrepancy theory.
• The NP-completeness of the bandwidth minimization problem
• Theory of monomer-dimer systems
• Twice-Ramanujan sparsifiers
• User-friendly tail bounds for sums of random matrices
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators

Cited In (6)

• Title not available (Why is no real title available?)
• Modulus metrics on networks
• Sampling discretization and related problems
• The solution of the Kadison-Singer problem
• Chip-firing games and critical groups
• Title not available (Why is no real title available?)

This page was built for publication: Graphs, vectors, and matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3178747)