Homological eigenvalues of graph p-Laplacians

Abstract

Inspired by persistent homology in topological data analysis, we introduce the homological eigenvalues of the graph p-Laplacian p, which allows us to analyse and classify non-variational eigenvalues. We show the stability of homological eigenvalues, and we prove that for any homological eigenvalue λ(p), the function p p(2λ(p))1p is locally increasing, while the function p 2-pλ(p) is locally decreasing. As a special class of homological eigenvalues, the min-max eigenvalues λ1(p), ·s, λk(p), ·s, are locally Lipschitz continuous with respect to p∈[1,+∞). We also establish the monotonicity of p(2λk(p))1p and 2-pλk(p) with respect to p∈[1,+∞). These results systematically establish a refined analysis of p-eigenvalues for varying p, which lead to several applications, including: (1) settle an open problem by Amghibech on the monotonicity of some function involving eigenvalues of p-Laplacian with respect to p; (2) resolve a question asking whether the third eigenvalue of graph p-Laplacian is of min-max form; (3) refine the higher order Cheeger inequalities for graph p-Laplacians by Tudisco and Hein, and extend the multi-way Cheeger inequality by Lee, Oveis Gharan and Trevisan to the p-Laplacian case. Furthermore, for the 1-Laplacian case, we characterize the homological eigenvalues and min-max eigenvalues from the perspective of topological combinatorics, where our idea is similar to the authors' work on discrete Morse theory.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…