Discrete quantitative nodal theorem

From MaRDI portal
Publication:820852




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. special case of this result will assert that if the second and third eigenvalues of the Laplacian are at least c apart, then the subgraphs induced by the positive and negative supports of the eigenvector belonging to the second eigenvalue are not only connected, but edge-expanders (in a weighted sense, with expansion depending on c).









This page was built for publication: Discrete quantitative nodal theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820852)