A generalization of the persistent Laplacian to simplicial maps

The graph Laplacian is a fundamental object in the analysis of and optimization on graphs. This operator can be extended to a simplicial complex K and therefore offers a way to perform ``signal processing" on p-(co)chains of K. Recently, the concept of persistent Laplacian was proposed and studied for a pair of simplicial complexes Khookrightarrow L connected by an inclusion relation, further broadening the use of Laplace-based operators. In this paper, we expand the scope of the persistent Laplacian by generalizing it to a pair of simplicial complexes connected by a simplicial map f: K → L. Such simplicial map setting arises frequently, e.g., when relating a coarsened simplicial representation with an original representation, or the case when the two simplicial complexes are spanned by different point sets i.e. cases in which it does not hold that Ksubset L. However, the simplicial map setting is more challenging than the inclusion setting since the underlying algebraic structure is more complicated. We present a natural generalization of the persistent Laplacian to the simplicial setting. To shed insight on the structure behind it, as well as to develop an algorithm to compute it, we exploit the relationship between the persistent Laplacian and the Schur complement of a matrix. A critical step is to view the Schur complement as a functorial way of restricting a self-adjoint PSD operator to a given subspace. As a consequence, we prove that persistent Betti numbers of a simplicial map can be recovered by persistent Laplacians. We then propose an algorithm for finding the matrix representations of persistent Laplacians which in turn yields a new algorithm for computing persistent Betti numbers of a simplicial map. Finally, we study the persistent Laplacian on simplicial towers under simplicial maps and establish monotonicity results for their eigenvalues.