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

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

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)

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Modulus metrics on networks
• Chip-Firing Games and Critical Groups
• Sampling discretization and related problems
• Title not available (Why is that?)

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)