Search arXivSearch

arXiv · 2507.19504

Topological Data Analysis and Topological Deep Learning Beyond Persistent Homology -- A Review

Abstract

Topological data analysis (TDA) is a rapidly evolving field in applied mathematics and data science that leverages tools from topology to uncover robust, shape-driven insights in complex datasets. The main workhorse is persistent homology, a technique rooted in algebraic topology. Paired with topological deep learning (TDL) or topological machine learning, persistent homology has achieved tremendous success in a wide variety of applications in science, engineering, medicine, and industry. However, persistent homology has many limitations due to its high-level abstraction, insensitivity to non-topological changes, and reliance on point cloud data. This paper presents a comprehensive review of TDA and TDL beyond persistent homology. It analyzes how persistent topological Laplacians and Dirac operators provide spectral representations to capture both topological invariants and homotopic evolution. Other formulations are presented in terms of sheaf theory, Mayer topology, and interaction topology. For data on differentiable manifolds, techniques rooted in differential topology, such as persistent de Rham cohomology, persistent Hodge Laplacian, and Hodge decomposition, are reviewed. For one-dimensional (1D) curves embedded in 3-space, approaches from geometric topology are discussed, including multiscale Gauss-link integrals, persistent Jones polynomials, and persistent Khovanov homology. This paper further discusses the appropriate selection of topological tools for different input data, such as point clouds, sequential data, data on manifolds, curves embedded in 3-space, and data with additional non-geometric information. A review is also given of various topological representations, software packages, and machine learning vectorizations. Finally, this review ends with concluding remarks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhe Su, Xiang Liu, Layal Bou Hamdan, Vasileios Maroulas, Jie Wu, Gunnar Carlsson, Guo-Wei Wei. 2025-07-12. Topological Data Analysis and Topological Deep Learning Beyond Persistent Homology -- A Review. https://arxiv.org/abs/2507.19504

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Stairs of Reconciliation: A Mathematical Tourist in Graz

Inside the Grazer Burg, two late-Gothic stone flights rise about distinct spindles, overlap, share several treads, and separate again. Their plan is governed not by a coaxial double helix but, to first approximation, by two intersecting circles. This elementary geometry yields a model of recurrent meeting and makes explicit the compatibility conditions that meeting requires. It also leads to a second object that geometers call a double spiral staircase - the helicoid - and to a useful distinction between resemblance and identity. The staircase becomes a meditation on how paths, models, and disciplines can meet without becoming the same.

math.HO

On the Reconstruction of SAS from Other Triangle Congruence Criteria

Starting from a Hilbert plane and removing the Side-Angle-Side (SAS) congruence axiom, we investigate to what extent SAS can be recovered synthetically from the remaining classical triangle congruence criteria. We show that the Angle-Side-Angle criterion, together with a ray correspondence principle corresponding to Theorem 13 of Hilbert's \emph{Grundlagen der Geometrie}, suffices to reconstruct SAS. We further show that both the Side-Side-Side and the Side-Angle-Angle criteria also suffice, once combined with the ray correspondence principle and suitable auxiliary principles -- the existence of midpoints and a hypotenuse-angle criterion for right triangles in the first case, and the existence of angle bisectors, the congruence of supplements of congruent angles, and the Pons Asinorum in the second. Although the two routes rely on auxiliary principles of different character, we show that they converge on a single final argument once a common hypotenuse-angle criterion is established. A metamathematical analysis, based on an explicit model adapted from Hilbert's own independence construction, complements these reconstructions: it shows that the ray correspondence principle alone cannot reconstruct any of the classical criteria, and that the Pons Asinorum and the hypotenuse-angle criterion are each independent of the remaining auxiliary principles used in their respective reconstructions. The resulting picture is not a formal hierarchy of the congruence criteria, but it does show that the Angle-Side-Angle reconstruction rests on a provably more economical basis than those obtained from Side-Side-Side or Side-Angle-Angle.

math.HO

Come for the vibe, stay for the math

This article describes our experiences in mathematical outreach over the past decade. We talk about specific activities, but also general principles that we've learned along the way.

math.HO