Nodal domain count for the generalized graph $p$-Laplacian

Abstract

Inspired by the linear Schrödinger 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ödinger operator.

Please cite this paper as:

@article{deidda2023nodal,
  title={Nodal domain count for the generalized graph p-Laplacian},
  author={Deidda, Piero and Putti, Mario and Tudisco, Francesco},
  journal={Applied and Computational Harmonic Analysis},
  year={2023},
  volume={64},
  pages={1--32}
}

Keywords: Cheeger inequality graph partitioning spectral clustering graph Laplacian nodal domains networks