PETLS: PErsistent Topological Laplacian Software
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911482917158912 |
|---|---|
| author | Jones, Benjamin Wei, Guo-Wei |
| author_facet | Jones, Benjamin Wei, Guo-Wei |
| contents | Persistent topological Laplacians are operators that provide persistent Betti numbers and additional multiscale geometric information through the eigenvalues of the persistent topological Laplacian matrix. We introduce a framework and novel algorithm to aid in the computation of persistent topological Laplacians. We implement existing and new persistent Laplacian algorithms in an efficient and flexible C++ library with Python bindings, titled PETLS: PErsistent Topological Laplacian Software. As part of this library, we interface with several complexes commonly used in topological data analysis (TDA), such as simplicial, alpha, directed flag, Dowker, and cellular Sheaf. Because increased efficiency broadens the set of computationally feasible applications, we provide recommendations on how to use algorithms and complexes for data analysis in machine learning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_11560 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | PETLS: PErsistent Topological Laplacian Software Jones, Benjamin Wei, Guo-Wei Algebraic Topology Persistent topological Laplacians are operators that provide persistent Betti numbers and additional multiscale geometric information through the eigenvalues of the persistent topological Laplacian matrix. We introduce a framework and novel algorithm to aid in the computation of persistent topological Laplacians. We implement existing and new persistent Laplacian algorithms in an efficient and flexible C++ library with Python bindings, titled PETLS: PErsistent Topological Laplacian Software. As part of this library, we interface with several complexes commonly used in topological data analysis (TDA), such as simplicial, alpha, directed flag, Dowker, and cellular Sheaf. Because increased efficiency broadens the set of computationally feasible applications, we provide recommendations on how to use algorithms and complexes for data analysis in machine learning. |
| title | PETLS: PErsistent Topological Laplacian Software |
| topic | Algebraic Topology |
| url | https://arxiv.org/abs/2508.11560 |