Nodal domains of eigenvectors for 1-Laplacian on graphs

DOI10.1016/J.AIM.2016.12.020zbMATH Open1366.35204arXiv1602.07472OpenAlexW2285342101MaRDI QIDQ507213FDOQ507213

Authors: Kung Ching Chang, Sihong Shao, Dong Zhang 

Publication date: 3 February 2017

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: The eigenvectors for graph $1$-Laplacian possess some sort of localization property: On one hand, any nodal domain of an eigenvector is again an eigenvector with the same eigenvalue; on the other hand, one can pack up an eigenvector for a new graph by several fundamental eigencomponents and modules with the same eigenvalue via few special techniques. The Courant nodal domain theorem for graphs is extended to graph $1$-Laplacian for strong nodal domains, but for weak nodal domains it is false. The notion of algebraic multiplicity is introduced in order to provide a more precise estimate of the number of independent eigenvectors. A positive answer is given to a question raised in [{sl K.~C. Chang, Spectrum of the $1$-Laplacian and Cheeger constant on graphs, J. Graph Theor., DOI: 10.1002/jgt.21871}], to confirm that the critical values obtained by the minimax principle may not cover all eigenvalues of graph $1$-Laplacian.

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

Recommendations

• Graph Laplacians, nodal domains, and hyperplane arrangements
• Eigenvectors of Random Graphs: Nodal Domains
• Eigenvectors of random graphs: nodal domains
• Nodal domain and eigenvalue multiplicity of graphs
• Nodal decompositions of graphs

zbMATH Keywords

spectral graph theoryLaplaciannodal domainCheeger's cutmultiplicity of eigenvalueoscillatory eigenfunction

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) General topics in linear spectral theory for PDEs (35P05) PDEs on graphs and networks (ramified or polygonal spaces) (35R02)

Cites Work

• Title not available (Why is that?)
• Discrete nodal domain theorems
• Title not available (Why is that?)
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• The 1-Laplacian Cheeger cut: theory and algorithms
• Spectrum of the 1-Laplacian and Cheeger's constant on graphs
• THE SPECTRUM OF THE 1-LAPLACE OPERATOR

Cited In (17)

• Nonsmooth critical point theory and applications to the spectral graph theory
• Spectrum of the 1-Laplacian and Cheeger's constant on graphs
• Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
• Nodal domain theorems for \(p\)-Laplacians on signed graphs
• Eigenvectors of random graphs: nodal domains
• Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
• The 1-Yamabe equation on graphs
• Topological multiplicity of the maximum eigenvalue of graph \(1\)-Laplacian
• Size of nodal domains of the eigenvectors of a \(G(n,p)\) graph
• Eigenvectors of Random Graphs: Nodal Domains
• Graph Laplacians, nodal domains, and hyperplane arrangements
• Spectrum of signless 1-Laplacian on simplicial complexes
• Nodal domain count for the generalized graph \(p\)-Laplacian
• Pseudo-orthogonality for graph 1-Laplacian eigenvectors and applications to higher Cheeger constants and data clustering
• Symmetric matrices, signed graphs, and nodal domain theorems
• Positive solutions of Yamabe-type equations with function coefficients on graphs
• Existence of global solutions to some nonlinear equations on locally finite graphs

This page was built for publication: Nodal domains of eigenvectors for 1-Laplacian on graphs

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