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).
Recommendations
- Discrete nodal domain theorems
- Courant's Nodal Line Theorem and Its Discrete Counterparts
- scientific article; zbMATH DE number 2042150
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- scientific article; zbMATH DE number 4136988
- Bourgain's discretization theorem
- Discrete Reifenberg-type theorem
- A discrete nodal domain theorem for trees
- Discrete Poincaré lemma
- Discrete Torelli theorem
Cites work
- scientific article; zbMATH DE number 4004190 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 1219775 (Why is no real title available?)
- scientific article; zbMATH DE number 1303522 (Why is no real title available?)
- scientific article; zbMATH DE number 598042 (Why is no real title available?)
- A short proof of the planarity characterization of Colin de Verdière
- Approximating the Permanent
- Discrete nodal domain theorems
- Eigenvalues and expanders
- Nodal geometry of graphs on surfaces
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(5)
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)