Urschel Nodal Domains via Perturbation Theory
Joel Friedman, Tong Ling, Soumyajit Saha

TL;DR
This paper establishes new Courant nodal domain theorems for generalized Laplacians on graphs using perturbation theory and an invariant called the Urschel number, providing refined bounds and classifications of eigenvector zeroes.
Contribution
It introduces refined invariants based on Urschel's number, classifies zeroes of eigenvectors, and extends nodal domain theorems for graphs with multiplicities.
Findings
Existence of orthogonal eigenvectors with bounds on Urschel numbers
Classification of zeroes as shallow or deep for simple eigenvalues
Bound on maximum nodal domains when no deep vertices are present
Abstract
We prove several types of Courant nodal domain theorems for generalized Laplacians on graphs, based on an invariant introduced by Urschel, which we call the "Urschel number", denoted , of an eigenvector . We refine Urschel's invariant, and use perturbation techniques to obtain some new results. First, we show the existence of mutually orthogonal eigenvectors, such that if the -th eigenvalue has multiplicity , then for , . Second, for a simple -th eigenvalue, we classify the zeroes of as either "shallow or "deep"; we obtain a number of results that say, roughly speaking, the more shallow vertices has, the more control we have over our new invariants based on Urschel's. Our new invariants of an eigenvector, , are a sequence of integers whose minimum value…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
