Nodal domain count for the generalized graph $p$-Laplacian
Preprint
Abstract
Inspired by the linear Schr\"odinger operator, we consider a generalized $p$-Laplacian operator on discrete graphs and present new results that characterize several spectral properties of this operator with particular attention to the nodal domain count of its eigenfunctions. Just like the one-dimensional continuous $p$-Laplacian, we prove that the variational spectrum of the discrete generalized $p$-Laplacian on forests is the entire spectrum. Moreover, we show how to transfer Weyl's inequalities for the Laplacian operator to the nonlinear case and prove new upper and lower bounds on the number of nodal domains of every eigenfunction of the generalized $p$-Laplacian on generic graphs, including variational eigenpairs. In particular, when applied to the linear case $p=2$, in addition to recovering well-known features, the new results provide novel properties of the linear Schr\"odinger operator.
Keywords
All Related Versions
This publication has 36 references indexed in Scilit:
- Analysis and algorithms for ℓ-based semi-supervised learning on graphsApplied and Computational Harmonic Analysis, 2022
- Dirichlet p-Laplacian eigenvalues and Cheeger constants on symmetric graphsAdvances in Mathematics, 2020
- Nodal domains of eigenvectors for 1-Laplacian on graphsAdvances in Mathematics, 2017
- Multi-class Transductive Learning Based on ℓ 1 Relaxations of Cheeger Cut and Mumford-Shah-Potts ModelJournal of Mathematical Imaging and Vision, 2013
- Handbook of Applied Analysis2009
- Variational Methods2008
- A Lower Bound for Nodal Count on Discrete and Metric GraphsCommunications in Mathematical Physics, 2007
- On the Generalization of the Courant Nodal Domain TheoremJournal of Differential Equations, 2002
- Methods of Mathematical Physics1989
- Eigenvalues and expandersCombinatorica, 1986