A Generalization of the Persistent Laplacian to Simplicial Maps

Authors Aziz Burak Gülen, Facundo Mémoli, Zhengchao Wan, Yusu Wang

Thumbnail PDF


  • Filesize: 0.72 MB
  • 17 pages

Document Identifiers

Author Details

Aziz Burak Gülen
  • Department of Mathematics, The Ohio State University, Columbus, OH, USA
Facundo Mémoli
  • Department of Mathematics and Department of Computer Science and Engineering, The Ohio State University, Columbus, OH, USA
Zhengchao Wan
  • Halıcıoğlu Data Science Institute, University of California San Diego, CA, USA
Yusu Wang
  • Halıcıoğlu Data Science Institute, University of California San Diego, CA, USA

Cite AsGet BibTex

Aziz Burak Gülen, Facundo Mémoli, Zhengchao Wan, and Yusu Wang. A Generalization of the Persistent Laplacian to Simplicial Maps. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 37:1-37:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


The (combinatorial) graph Laplacian is a fundamental object in the analysis of, and optimization on, graphs. Via a topological view, 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 K ↪ L connected by an inclusion relation, further broadening the use of Laplace-based operators. In this paper, we significantly expand the scope of the persistent Laplacian by generalizing it to a pair of weighted simplicial complexes connected by a weight preserving simplicial map f: K → L. Such a 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 K ⊂ L. However, the simplicial map setting is much more challenging than the inclusion setting since the underlying algebraic structure is much 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 positive semi-definite operator to a given subspace. As a consequence of this relation, we prove that the qth persistent Betti number of the simplicial map f: K → L equals the nullity of the qth persistent Laplacian Δ_q^{K,L}. We then propose an algorithm for finding the matrix representation of Δ_q^{K,L} which in turn yields a fundamentally different algorithm for computing the qth persistent Betti number of a simplicial map. Finally, we study the persistent Laplacian on simplicial towers under weight-preserving simplicial maps and establish monotonicity results for their eigenvalues.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Spectra of graphs
  • Mathematics of computing → Algebraic topology
  • combinatorial Laplacian
  • persistent Laplacian
  • Schur complement
  • persistent homology
  • persistent Betti number


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Jiahui Chen, Yuchi Qiu, Rui Wang, and Guo-Wei Wei. Persistent laplacian projected omicron ba. 4 and ba. 5 to become new dominating variants. arXiv preprint arXiv:2205.00532, 2022. Google Scholar
  2. Fan Chung. Spectral Graph Theory. American Mathematical Society, 1997. Google Scholar
  3. Tamal Dey, Fengtao Fan, and Yusu Wang. Computing topological persistence for simplicial maps. Proceedings of the Annual Symposium on Computational Geometry, 2012. Google Scholar
  4. Tamal Krishna Dey, Fengtao Fan, and Yusu Wang. Graph induced complex on point data. In Proceedings of the twenty-ninth annual symposium on Computational geometry, pages 107-116, 2013. Google Scholar
  5. Art Duval and Victor Reiner. Shifted simplicial complexes are Laplacian integral. Transactions of the American Mathematical Society, 354(11):4313-4344, 2002. Google Scholar
  6. Beno Eckmann. Harmonische funktionen und randwertaufgaben in einem komplex. Commentarii Mathematici Helvetici, 17(1):240-255, 1944. Google Scholar
  7. Timothy E Goldberg. Combinatorial Laplacians of simplicial complexes. Senior Thesis, Bard College, 2002. Google Scholar
  8. Aziz Burak Gülen, Facundo Mémoli, Zhengchao Wan, and Yusu Wang. A generalization of the persistent laplacian to simplicial maps. arXiv preprint arXiv:2302.03771, 2023. Google Scholar
  9. Renee S Hoekzema, Lewis Marsh, Otto Sumray, Thomas M Carroll, Xin Lu, Helen M Byrne, and Heather A Harrington. Multiscale methods for signal selection in single-cell data. Entropy, 24(8):1116, 2022. Google Scholar
  10. Danijela Horak and Jürgen Jost. Spectra of combinatorial Laplace operators on simplicial complexes. Advances in Mathematics, 244:303-336, 2013. Google Scholar
  11. Yuta Hozumi, Rui Wang, and Guo-Wei Wei. Ccp: Correlated clustering and projection for dimensionality reduction. arXiv preprint arXiv:2206.04189, 2022. Google Scholar
  12. Ioannis Koutis, Gary Miller, and Richard Peng. A fast solver for a class of linear systems. Communications of the ACM, 55, 2012. Google Scholar
  13. James R Lee, Shayan Oveis Gharan, and Luca Trevisan. Multi-way spectral partitioning and higher-order Cheeger inequalities. In Symposium on Theory of Computing (STOC), pages 1117-1130, 2012. URL: https://doi.org/10.1145/2213977.2214078.
  14. André Lieutier. Talk: Persistent harmonic forms. URL: https://project.inria.fr/gudhi/files/2014/10/Persistent-Harmonic-Forms.pdf.
  15. Oren E Livne and Achi Brandt. Lean algebraic multigrid (lamg): Fast graph Laplacian linear solver. SIAM Journal on Scientific Computing, 34(4):B499-B522, 2012. Google Scholar
  16. Facundo Mémoli, Zhengchao Wan, and Yusu Wang. Persistent laplacians: Properties, algorithms and implications. SIAM Journal on Mathematics of Data Science, 4(2):858-884, 2022. Google Scholar
  17. Andrew Y Ng, Michael I Jordan, and Yair Weiss. On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems, 14(2):849-856, 2002. Google Scholar
  18. Daniel Spielman. Spectral and algebraic graph theory. Yale lecture notes, draft of December, 4:47, 2019. Google Scholar
  19. Daniel A Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 81-90, 2004. Google Scholar
  20. Nisheeth K Vishnoi. Lx = b: Laplacian solvers and their algorithmic applications. Found. Trends Theor. Comput. Sci., 8(1-2):1-141, 2013. URL: https://doi.org/10.1561/0400000054.
  21. Ulrike von Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395-416, 2007. URL: https://doi.org/10.1007/s11222-007-9033-z.
  22. Rui Wang, Duc Duy Nguyen, and Guo-Wei Wei. Persistent spectral graph. International Journal for Numerical Methods in Biomedical Engineering, page e3376, 2020. Google Scholar
  23. Xiaoqi Wei and Guo-Wei Wei. Persistent sheaf Laplacians. arXiv preprint arXiv:2112.10906, 2021. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail