Signatures, Lifts, and Eigenvalues of Graphs
From MaRDI portal
Publication:5126345
DOI10.1007/978-3-030-44097-8_13zbMath1473.05176arXiv1412.6841OpenAlexW3043880191MaRDI QIDQ5126345
Shiping Liu, Norbert Peyerimhoff, Alina Vdovina
Publication date: 16 October 2020
Published in: Discrete and Continuous Models in the Theory of Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.6841
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Expander graphs (05C48)
Related Items
Curvature and Higher Order Buser Inequalities for the Graph Connection Laplacian ⋮ Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expansion of random graphs: new proofs, new results
- Random graph coverings. I: General theory and graph connectivity
- Lifts, discrepancy and nearly optimal spectral gap
- Signed graphs
- The topological theory of current graphs
- Quotients of complete graphs: revisiting the Heawood map-coloring problem
- Generating all graph coverings by permutation voltage assignments
- Discrete magnetic Laplacian
- Relative expanders or weakly relatively Ramanujan graphs.
- Ramanujan coverings of graphs
- Voltage graphs
- Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Shift lifts preserving Ramanujan property
- Theory of monomer-dimer systems
- On the notion of balance of a signed graph
- Expander graphs and their applications
- Matchings and walks in graphs
- Branched coverings of graph imbeddings
- Ramanujan Graphs and the Solution of the Kadison-Singer Problem
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Orientable embedding of Cayley graphs
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians