Discrete quantitative nodal theorem (Q820852): Difference between revisions

Summary: 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)\).