2 papers
cs.DS2025
Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
Tommaso d'Orsi, Chris Jones, Jake Ruotolo +2
Whether or not the Sparsest Cut problem admits an efficient -approximation algorithm is a fundamental algorithmic question with connections to geometry and the Unique Games C…
math.CO2025
Singular Values Versus Expansion in Directed and Undirected Graphs
Jake Ruotolo, Salil Vadhan
We relate the nontrivial singular values of the normalized adjacency matrix of an Eulerian directed graph to combinatorial measures of graph expansion: \\ 1. We…