Together, persistent homology and Mapper provide complementary topological perspectives on the same data: persistent homology identifies a quantitatively distinct topological structure between the benign and malignant groups (quantified via the 1-Wasserstein distance), while Mapper localizes where this difference manifests in the data as transition zones and class-dominated subgraphs.
Abstract
Topological data analysis offers techniques for uncovering structure in high-dimensional datasets, with persistent homology and the Mapper algorithm being two widely used methods. Persistent homology captures topological features across filtration scales, while Mapper constructs a graph-based summary of the data at a chosen resolution. In this paper, we apply both methods to the Wisconsin Breast Cancer Dataset in order to compare the type of structural information each method provides. Rather than treating persistent homology and Mapper as competing tools, we frame them as complementary approaches. Persistent homology summarizes the underlying shape of the data across different scales, while Mapper highlights clustering structure, local connectivity, and regions where benign and malignant samples exhibit overlapping characteristics in the feature space. We further support the visual persistent homology analysis using Wasserstein distances between persistent diagrams. Together, persistent homology and Mapper provide complementary topological perspectives on the same data: persistent homology identifies a quantitatively distinct topological structure between the benign and malignant groups (quantified via the 1-Wasserstein distance), while Mapper localizes where this difference manifests in the data as transition zones and class-dominated subgraphs. Neither method alone provides both the global algebraic summary and the local graph-level resolution that the combined analysis yields.
The mathematical foundations of persistent homology are reviewed, its computational realisation via simplicial filtrations and persistence diagrams is described, and representative applications are surveyed.
E. Julie· International Journal of Pur...· 0 citations
A kernel-means algorithm built on a convex combination of sliced Wasserstein (SW) kernels, one for each homology under consideration, which outperforms the baselines on two benchmark datasets and remains competitive on a third synthetic dataset, while being computationally efficient.
Vikram T. Aithal, Ajit Kumar, Ambika Sharma· 0 citations
The qualitative analysis of nonlinear dynamical systems relies on identifying geometric and topological structures that govern phase-space organization. We develop a computational framework based on novel topological and geometric descriptors of vector fields that enables robust comparison of dynamical regimes from bot...
Marta Marszewska, Justyna Signerska, Paweł Dłotko· 0 citations
This paper initiates a systematic approach to handling mathematical data structured as (truncated) infinite $q-series, or equivalently, infinite series of integers, and demonstrates that neural networks can reliably extract essential topological information, such as homology class and underlying graph structure, direct...
Brandon Robinson, Shimal Harichurn, Fabian Ruehle et al.· 0 citations
The distance matrix of a finite point cloud can be visualized as a heatmap. When the data arise from a time series, the sublevel sets of this image are known as recurrence plots and are widely used in time series analysis. Motivated by this perspective, we establish a relationship between the distance-matrix filtration...