Discrete Quantitative Nodal Theorem
We prove a theorem that can be thought of as a common generalization of the Discrete Nodal Theorem and (one direction of) Cheeger's Inequality for graphs. A special case of this result will assert that if the second and third eigenvalues of the Laplacian are at least $\varepsilon$ apart, then the subgraphs induced by the positive and negative supports of the eigenvector belonging to $\lambda_2$ are not only connected, but edge-expanders (in a weighted sense, with expansion depending on $\varepsilon$).
Keyword(s):
2013 ◽
Vol 23
(03)
◽
pp. 1350011
◽
1978 ◽
Vol 36
(1)
◽
pp. 492-493
2016 ◽
Vol 32
(3)
◽
pp. 204-214
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 3
(4)
◽
pp. 209-222
Keyword(s):