Paper Info
Title
Discrete Quantitative Nodal Theorem
Abstract
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 epsilon 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 epsilon).
Year
DOI
Venue
2021
10.37236/9944
ELECTRONIC JOURNAL OF COMBINATORICS
DocType
Volume
Issue
Journal
28
3
ISSN
Citations 
PageRank 
1077-8926
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
László Lovász1791152.09