Nodal domains of eigenvectors for 1-Laplacian on graphs

详细信息    查看全文

• 作者：K.C. Chang ^{kcchang@math.pku.edu.cn} ; Sihong Shao ; ^{sihong@math.pku.edu.cn} ; Dong Zhang ^{dongzhang@pku.edu.cn}
• 关键词：Laplacian ; Spectral graph theory ; Nodal domain ; Multiplicity of eigenvalue ; Cheeger's cut ; Oscillatory eigenfunction
• 刊名：Advances in Mathematics
• 出版年：2017
• 出版时间：21 February 2017
• 年：2017
• 卷：308
• 期：Complete
• 页码：529-574
• 全文大小：801 K
• 卷排序：308

文摘

The eigenvectors for graph 1-Laplacian possess some sort of localization property: On one hand, the characteristic function on 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 Chang (2016) [3], to confirm that the critical values obtained by the minimax principle may not cover all eigenvalues of graph 1-Laplacian.