An algorithm to evaluate the spectral expansion
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3873585 (Why is no real title available?)
- scientific article; zbMATH DE number 4165188 (Why is no real title available?)
- scientific article; zbMATH DE number 3978003 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1849959 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- A proof of Alon’s second eigenvalue conjecture and related problems
- Characterization of expansion-related properties of modular graphs
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
- Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
- Eigenvalues and expanders
- Expander graphs and their applications
- Explicit construction of linear sized tolerant networks
- Ihara zeta function, coefficients of Maclaurin series and Ramanujan graphs
- Matrix multiplication via arithmetic progressions
- Multiplying matrices faster than coppersmith-winograd
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- On the second eigenvalue of a graph
- Powers of tensors and fast matrix multiplication
- Ramanujan graphs
- Some geometric aspects of graphs and their eigenfunctions
- THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
- The sharp threshold for percolation on expander graphs
- Unramified graph covers of finite degree
- Zeta and L-functions in number theory and combinatorics
This page was built for publication: An algorithm to evaluate the spectral expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897458)