math.ATMay 7, 2023

Analysing Multiscale Clusterings with Persistent Homology

Authors: Juni Schindler, Mauricio Barahona

Organizations: Department of Mathematics, Imperial College London, UK

Abstract

In data clustering, it is often desirable to find not just a single partition into clusters but a sequence of partitions that describes the data at different scales (or levels of coarseness). A natural problem then is to analyse and compare, as a whole, the (not necessarily hierarchical) sequences of partitions that underpin such multiscale descriptions. Using tools from topological data analysis, we introduce here the Multiscale Clustering Filtration (MCF), a filtration of abstract simplicial complexes that encodes arbitrary cluster assignments in a sequence of partitions across scales of increasing coarseness. We prove the stability of the MCF with respect to small changes in the sequence of partitions, and establish that its persistence diagram (PD) provides an interpretable representation of the multiscale clustering: at dimension 0, it captures violations of the refinement order, and at higher dimensions, it tracks the emergence and resolution of higher-order inconsistencies between cluster assignments. We also introduce an equivalent construction of the MCF via a nerve complex filtration, and show that this nerve-based MCF has computational advantages in certain settings, aiding scalability. Further, we show that in the hierarchical case, the MCF reduces to a Vietoris-Rips filtration of an ultrametric space, and we establish that pairwise measures, such as conditional entropy or zigzag persistence, are fully determined by a graph representation of the Sankey diagram and thus fail to describe the higher-order inconsistencies across scales that MCF captures. Using synthetic and real-world data from stochastic block models, single-cell transcriptomics and temporal social interactions, we illustrate how the MCF PD serves to characterise and compare multiscale clusterings beyond pairwise or hierarchical baseline methods.

Figures & tables

Appendix figures & tables10 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Dec 29, 2025

Finite Topological Space Filtrations: A Topological Framework for Data Analysis

We introduce a data-analysis framework based on filtrations of finite topological spaces. Starting from a finite metric data set, we construct a sequence of coarsening topologies on the same set of points. These topologies give persistence modules and barcodes in the usual way, but they also retain information that is lost when the filtration is reduced to homology. At each level one can examine, for example, which points are topologically indistinguishable, how their minimal neighbourhoods overlap, how connected components merge, and how these features change from one level to the next. We develop the basic theory of these filtrations, establish stability results under suitable hypotheses, and give practical constructions starting directly from a distance matrix. We then study what can be learned from the resulting finite topologies. On synthetic data with known clusters of different shapes, sizes, and densities, we examine how these regions appear among the finite-topological structures and how they merge as the topology coarsens. We also study what happens when points that become uncovered early in the construction are removed and the analysis is repeated. For one-dimensional homology, we use paths in the finite-topological structure to locate cycles and to examine how their appearance is related to the geometry of the data. We finally apply these ideas to two real data sets with quite different structures. On the Paul15 single-cell data, we use the evolving finite topology to examine fine cellular states, their overlaps and relations, their assembly into larger groups, and the effect of removing points that connect these structures. On COIL20, where images of an object are sampled through a full rotation, we study how the cyclic organization of the images is reflected in the finite-topological evolution and in the associated one-dimensional homology.
Dec 18, 2025

Persistent Multiscale Density-based Clustering

Clustering is a cornerstone of modern data analysis. Detecting clusters in exploratory data analyses (EDA) requires algorithms that make few assumptions about the data. Density-based clustering algorithms are particularly well-suited for EDA because they describe high-density regions, assuming only that a density exists. Applying density-based clustering algorithms in practice, however, requires selecting appropriate hyperparameters, which is difficult without prior knowledge of the data distribution. For example, DBSCAN requires selecting a density threshold, and HDBSCAN* relies on a minimum cluster size parameter. In this work, we propose Persistent Leaves Spatial Clustering for Applications with Noise (PLSCAN), a multiscale density-based clustering algorithm that replaces HDBSCAN*'s fixed minimum cluster size pruning of a mutual-reachability linkage hierarchy with a persistence-based cluster selection procedure. Effectively, PLSCAN identifies all minimum cluster sizes for which HDBSCAN* produces stable (leaf) clusters. In concept, PLSCAN applies scale-space clustering principles and is equivalent to persistent homology on a novel metric space. We compare its performance to HDBSCAN* on several real-world datasets, demonstrating that it achieves a higher median ARI, is less sensitive to changes in the number of mutual reachability neighbours, and has higher stability under resampling. Additionally, we compare PLSCAN's computational costs to kk-Means++, demonstrating competitive run-times on low-dimensional datasets. At higher dimensions, run times scale more similarly to HDBSCAN*.
Oct 4, 2026

The sublevel Flood bifiltration: towards scalable 2-parameter persistent homology

Multiparameter persistent homology is a rapidly developing branch of topological data analysis that improves the robustness of single-parameter persistent homology to outliers, while still capturing the metric characteristics of the data. However, a notable limitation is its lack of scalability. In this paper, we introduce a novel approach for efficiently computing 2-parameter persistent homology on large point sets. Our work extends the Flood filtration, originally developed for single-parameter persistence. Our construction, called the sublevel Flood bifiltration, offers a scalable approximation of the sublevel offset bifiltration. We show that it benefits from theoretical stability properties and describe how to compute it efficiently. We demonstrate the performance of our approach in classification tasks on low-dimensional synthetic datasets, where density awareness is critical, as well as on real-world time series datasets.