Nodal domain theorems for p-Laplacians on signed graphs
From MaRDI portal
Publication:6146940
Abstract: We establish various nodal domain theorems for -Laplacians on signed graphs, which unify most of the existing results on nodal domains of graph -Laplacians and arbitrary symmetric matrices. Based on our nodal domain estimates, we obtain a higher order Cheeger inequality that relates the variational eigenvalues of -Laplacians and Atay-Liu's multi-way Cheeger constants on signed graphs. In the particular case of , 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 -Laplacians and nonexistence of eigenvalues between the largest and second largest variational eigenvalues of -Laplacians with on connected bipartite graphs.
Cites work
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3533576 (Why is no real title available?)
- scientific article; zbMATH DE number 1793704 (Why is no real title available?)
- scientific article; zbMATH DE number 2191998 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- A discrete nodal domain theorem for trees
- A lower bound for nodal count on discrete and metric graphs
- A modeling and computational study of the frustration index in signed networks
- A nodal domain theorem and a higher-order Cheeger inequality for the graph \(p\)-Laplacian
- A short proof of the planarity characterization of Colin de Verdière
- Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
- Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
- Discrete nodal domain theorems
- Discrete quantitative nodal theorem
- Eigenfunctions and nodal sets
- Eigenvectors of acyclic matrices
- Equiangular lines with a fixed angle
- Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
- Graph partitioning by eigenvectors
- Graphs and their real eigenvectors
- Handbook of applied analysis
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- Magnetic interpretation of the nodal defect on graphs
- Multiplicity techniques for problems without compactness
- Nodal count of graph eigenfunctions via magnetic perturbation
- Nodal domain and eigenvalue multiplicity of graphs
- Nodal domain count for the generalized graph \(p\)-Laplacian
- Nodal domains of eigenvectors for 1-Laplacian on graphs
- On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
- On the isoperimetric spectrum of graphs and its approximations
- On the notion of balance of a signed graph
- Optimization and nonsmooth analysis
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Signed graphs
- Some geometric aspects of graphs and their eigenfunctions
- Spectrum of the 1-Laplacian and Cheeger's constant on graphs
- Spherical two-distance sets and eigenvalues of signed graphs
- Symmetric matrices, signed graphs, and nodal domain theorems
- The Lemmens-Seidel conjecture and forbidden subgraphs
- Variational Methods
- Variational methods for non-differentiable functionals and their applications to partial differential equations
- \(p\)-Laplace operators for oriented hypergraphs
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)