Nodal domain count for the generalized graph p-Laplacian

01/04/2022
by   Piero Deidda, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2022

Laplacian operator on statistical manifold

In this paper, we define a Laplacian operator on a statistical manifold,...
research
09/03/2022

Discontinuities of the Integrated Density of States for Laplacians Associated with Penrose and Ammann-Beenker Tilings

Aperiodic substitution tilings provide popular models for quasicrystals,...
research
08/28/2017

Towards Spectral Sparsification of Simplicial Complexes Based on Generalized Effective Resistance

As a generalization of the use of graphs to describe pairwise interactio...
research
07/04/2022

Generalized Spectral Coarsening

Many computational algorithms applied to geometry operate on discrete re...
research
01/28/2011

An Analysis of the Convergence of Graph Laplacians

Existing approaches to analyzing the asymptotics of graph Laplacians typ...
research
05/26/2022

SigMaNet: One Laplacian to Rule Them All

This paper introduces SigMaNet, a generalized Graph Convolutional Networ...
research
10/17/2020

Continuum limit of p-Laplacian evolution problems on graphs:L^q graphons and sparse graphs

In this paper we study continuum limits of the discretized p-Laplacian e...

Please sign up or login with your details

Forgot password? Click here to reset