SearcharxivSearch

arXiv · 2606.30095

A Systematic Framework for Evaluating Topological Representations in Single-Cell Classification

Abstract

Recent advances in biomedicine generate high-dimensional single-cell data that describe cellular heterogeneity with unprecedented detail, but their geometric complexity and non-linear structure often limit the effectiveness of conventional statistical tools. Topological Data Analysis (TDA) provides a mathematical framework for characterizing the shape of data through persistent homology, which extracts structural features such as connected components and cycles across multiple scales. In this work, we propose a systematic two-level framework for evaluating topological representations in high-dimensional single-cell classification. The first level (\(R_1\)) performs statistical screening of topological descriptors based on separability between clinical groups, whereas the second level (\(R_2\)) evaluates their predictive utility in supervised classification models. This design makes it possible to compare representations not only in terms of discriminative performance, but also in terms of robustness to analytical choices. We illustrate the framework using bone marrow flow cytometry data from pediatric acute lymphoblastic leukemia, with a particular focus on relapse stratification. The results show that different topological representations vary substantially in both statistical separability and predictive stability, with Betti Curves and Persistence Silhouettes showing more robust behavior than Persistence Images in this cohort. Overall, the study provides a reproducible methodological framework for the systematic comparison of topological descriptors in complex biomedical point clouds.

Explore related subjects

Keep this discovery

BibTeXRIS

Rocío Picón-González, Salvador Chulián, Ana Niño-López, Álvaro Martínez-Rubio, María Rosa Durán. 2026-06-29. A Systematic Framework for Evaluating Topological Representations in Single-Cell Classification. https://arxiv.org/abs/2606.30095

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

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN