Nodal domain theorems for p-Laplacians on signed graphs

DOI10.4171/JST/472arXiv2209.09080OpenAlexW4388978536MaRDI QIDQ6146940FDOQ6146940

Authors: Chuanyuan Ge, Shiping Liu, Dong Zhang 

Publication date: 31 January 2024

Published in: Journal of Spectral Theory (Search for Journal in Brave)

Abstract: We establish various nodal domain theorems for $p$-Laplacians on signed graphs, which unify most of the existing results on nodal domains of graph $p$-Laplacians and arbitrary symmetric matrices. Based on our nodal domain estimates, we obtain a higher order Cheeger inequality that relates the variational eigenvalues of $p$-Laplacians and Atay-Liu's multi-way Cheeger constants on signed graphs. In the particular case of $p=1$, this leads to several identities relating variational eigenvalues and multi-way Cheeger constants. Intriguingly, our approach also leads to new results on usual graphs, including a weak version of Sturm's oscillation theorem for graph $1$-Laplacians and nonexistence of eigenvalues between the largest and second largest variational eigenvalues of $p$-Laplacians with $p>1$ on connected bipartite graphs.

Full work available at URL: https://arxiv.org/abs/2209.09080

zbMATH Keywords

\(p\)-Laplaciansigned graphnodal domain

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Nonlinear spectral theory, nonlinear eigenvalue problems (47J10)

Cites Work

• Title not available (Why is that?)
• Signed graphs
• On the notion of balance of a signed graph
• Optimization and nonsmooth analysis
• Magnetic interpretation of the nodal defect on graphs
• Title not available (Why is that?)
• Variational Methods
• Handbook of applied analysis
• Eigenfunctions and nodal sets
• On the isoperimetric spectrum of graphs and its approximations
• Variational methods for non-differentiable functionals and their applications to partial differential equations
• Graph partitioning by eigenvectors
• Perron-Frobenius type results and discrete versions of nodal domain theorems
• Title not available (Why is that?)
• Discrete nodal domain theorems
• A short proof of the planarity characterization of Colin de Verdière
• Eigenvectors of acyclic matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• A lower bound for nodal count on discrete and metric graphs
• A discrete nodal domain theorem for trees
• Some geometric aspects of graphs and their eigenfunctions
• Nodal count of graph eigenfunctions via magnetic perturbation
• Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
• Spectrum of the 1-Laplacian and Cheeger's constant on graphs
• Nodal domains of eigenvectors for 1-Laplacian on graphs
• Multiplicity techniques for problems without compactness
• Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
• Graphs and their real eigenvectors
• Discrete quantitative nodal theorem
• On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
• A nodal domain theorem and a higher-order Cheeger inequality for the graph \(p\)-Laplacian
• \(p\)-Laplace operators for oriented hypergraphs
• Nodal domain and eigenvalue multiplicity of graphs
• Symmetric matrices, signed graphs, and nodal domain theorems
• Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
• A modeling and computational study of the frustration index in signed networks
• Equiangular lines with a fixed angle
• Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
• The Lemmens-Seidel conjecture and forbidden subgraphs
• Nodal domain count for the generalized graph \(p\)-Laplacian
• Spherical two-distance sets and eigenvalues of signed graphs

Cited In (1)

• Curvature, diameter and signs of graphs

This page was built for publication: Nodal domain theorems for \(p\)-Laplacians on signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146940)