A faster algorithm of up persistent Laplacian over non-branching simplicial complexes

Abstract

In this paper we present an algorithm for computing the matrix representation $\Delta_{q, \mathrm{up}}^{K, L}$ of the up persistent Laplacian $\triangle_{q, \mathrm{up}}^{K, L}$ over a pair of non-branching and orientation-compatible simplicial complexes $K\hookrightarrow L$, which has quadratic time complexity. Moreover, we show that the matrix representation $\Delta_{q, \mathrm{up}}^{K, L}$ can be identified as the Laplacian of a weighted oriented hypergraph, which can be regarded as a higher dimensional generalization of the Kron reduction. Finally, we introduce a Cheeger-type inequality with respect to the minimal eigenvalue $\lambda_{\mathbf{min}}^{K, L}$ of $\Delta_{q, \mathrm{up}}^{K, L}$.