72 citations · 174 across the 24 of their papers we have counts for
3 papers · 1 filter
Many nodal domains in random regular graphs
Shirshendu Ganguly, Theo McKenzie, Sidhanth Mohanty +1
Let be a random -regular graph. We prove that for every constant , with high probability every eigenvector of the adjacency matrix of with eigenvalue less than $-2…
Bit Complexity of Jordan Normal Form and Spectral Factorization
Papri Dey, Ravi Kannan, Nick Ryder +1
We study the bit complexity of two related fundamental computational problems in linear algebra and control theory. Our results are: (1) An $\tilde{O}(n^{ω+3}a+n^4a^2+n^ω\log(1/ε))…
A Spectral Approach to Polytope Diameter
Hariharan Narayanan, Rikhav Shah, Nikhil Srivastava
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of th…