This short paper presents a general approach for computing robust Wasserstein barycenters[2], [80], [81] of persistence diagrams. The classical method consists in computing assignment arithmetic means after finding the optimal transport plans between the barycenter and the persistence diagrams. However, this procedure only works for the transportation cost related to the $q$-Wasserstein distance $W_{q}$ when $q=2$. We adapt an alternative fixed-point method[76] to compute a barycenter diagram for generic transportation costs ($q \gt 1$), in particular those robust to outliers , $q \in (1,2)$. We show the utility of our work in two applications : (i) the clustering of persistence diagrams on their metric space and (ii) the dictionary encoding of persistence diagrams [73]. In both scenarios, we demonstrate the added robustness to outliers provided by our generalized framework. Our Python implementation is available at this address: https://github.com/Keanu-Sisouk/RobustBarycenter.

Curse of dimensionality on persistence diagrams

Statistical learning on measures: An application to persistence diagrams

Topological Data Analysis (TDA) is used to extract topological features such as rings from point clouds. Recent works have identified that existing methods, which construct persistence diagrams in TDA, are not robust to noise and varied densities in a point cloud. This causes these methods to obtain incorrect topological features. We analyze the necessary properties of an approach that can address these two issues, and propose a new filter function for TDA based on a new data-dependent kernel that possesses these properties. Our empirical evaluation reveals that (i) the proposed kernel provides a better mean for UMAP dimensionality reduction (ii) the proposed filter function can significantly improve the performance of Topological Point Cloud Clustering (iii) the proposed filter function is a more effective way of constructing Persistence Diagram for t-SNE visualization and SVM classification than three existing methods of TDA, In addition, we explore the proposed filter’s performance on a more complex deformation named Riemannian stretching. Our proposed filter equipped with Sample Fermat distance outperforms all the other filters when noise and Riemannian stretching coexist. Code is available at https://github.com/IsolationKernel/Codes/tree/main/Lambda-kernel.

Approximation algorithms for 1-Wasserstein distance between persistence diagrams

Abstract Interactions of the maxima and minima of the univariate functions appear in combinatorics as Dyck paths, and in topological data analysis as persistent homology. We study these descriptors for Brownian motions with drift, deriving the intensity measure and correlation functions for the persistence diagram point process $$\textbf{PH}_0$$ PH 0 , and quantifying the intrinsic asymmetries in the coupling of maxima and minima.

Abstract The persistent homology transform, Betti function transform, and Euler characteristic transform represent a shape with a multiset of persistence diagrams, Betti functions, or Euler characteristic functions, respectively, parameterized by the sphere of directions in the ambient space. In this work, we give the first explicit construction of finite sets of directions discretizing the verbose variants of these transforms and show that such discretizations faithfully represent the underlying shape. Our discretization, while exponential in the dimension of the shape, does not depend on any restrictions on the particular immersion beyond general position, and is stable with respect to various perturbations.

The microstructure of porous electrodes of solid oxide cells (SOCs) significantly impacts their electrochemical performance. Therefore, various attempts have been made to analyze their complex porous microstructure in three dimensions. The obtained microstructures have been quantitatively evaluated using structural metrics, such as volume fraction, surface area density, and tortuosity factor of the constituent phases, as well as double- and triple-phase boundaries. These structural characteristics are useful to correlate the electrode performance with their microstructure, thereby determining optimal electrode design. However, these intuitive metrics often fails to explain the electrode performance. In fact, structural changes during long term operation of SOCs are subtle so that the performance degradation of the electrodes cannot be fully detected by these intuitive characteristics. Therefore, it is necessary to find a way to extract hidden structural metrics that characterize the electrode microstructure and to clarify their correlation with electrode performance.One of the promising candidates for such structural metrics is topological information. Topology is a structural property that is invariant to successive deformation operations, such as connected structures and the number of holes in the structures. Topology-based structural analysis has many applications in material science, where macroscopic properties of materials are correlated with topological information about their internal structures (e.g., crystal structures). For example, Wang et al. [1] performed a topological analysis on the crystal structure of double-phase steel to characterize its structure and to predict its macroscopic properties, such as stress-strain curves. Application of topological data analysis is also found in the analysis of SOFC electrodes; Pawlowski et al. [2] attempted to capture the structural changes in SOFC anodes during long-term operation from a topological perspective.In addition, topological analysis is regarded as a tool for dimensional reduction of complex structural information. Therefore, the information extracted from the topological analysis can be used to evaluate conventional metrics of porous microstructures, such as surface area and triple-phase boundary. If these metrics can be accurately evaluated from a limited number of information from the topological analysis, the numerical cost is expected to be significantly reduced.Therefore, this study investigates the applicability of the topological analysis to the electrode microstructure analysis. Fig. 1 shows the schematic diagram of the structural analysis in this study. First, persistent homology analysis [3] is employed to extract the topological information of the electrodes, where the birth and death of topological features are detected during the filtration process within the structure datasets to produce the persistent diagram (PD). The persistent diagram is then discretized and concatenated to obtain the persistent image (PI). Subsequently, principal component analysis (PCA) is conducted to further reduce the dimensionality of the structural information extracted in the persistent image. The obtained values of the principal components are correlated with the conventional structural metrics of the porous electrodes, such as volume fraction, surface area density, and triple-phase boundary density.Moreover, neural networks (NNs) consisting of fully-connected layers are constructed to quantify the structural metrics from the principal components. The constructed neural networks are trained using the real electrode microstructure datasets obtained using the focused ion beam and scanning electron microstructure [4]. To validate the developed neural networks, they are compared with the convolutional neural network (CNN), which directly quantifies the microstructural metrics from the three-dimensional structures, in terms of quantification accuracy, the number of training datasets, and required training time.The values obtained from the topological analysis followed by the principal component analysis are found to contain essential structural information in the porous electrodes. This is implied by the fact that the principal component values obtained from the real structure datasets are significantly different from those from the artificial sphere-packing structures, even though the conventional structural metrics, i.e., volume fraction and surface density, are identical between the real and artificial structures. In addition, the principal component values have sensitivity to the conventional statistical metrics, because the structures with different solid compositions form clusters in different locations in a principal component space. These suggest that the topological information will be useful not only to detect subtle structural changes in the porous electrodes undetectable in conventional structural metrics, but also to reduce the dimensionality of the complex porous electrodes without losing the information quality.Since the information extracted using the persistent homology and principal component analysis possess essential information about the electrode structures, conventional microstructural metrics are accurately quantified by the constructed neural network. It should be emphasized that the number of parameters in the neural network that need to be adjusted during the training process is significantly reduced compared with the convolutional neural network. As a result, the number of required datasets for the training of the network is significantly reduced. These clearly indicate the effectiveness of the dimensional reduction in the quantification of the electrode microstructures.

Persistent homology has been widely used to discover hidden topological structures in data across various applications, including music data. To apply persistent homology, a distance or metric must be defined between points in a point cloud or between nodes in a graph network. These definitions are not unique and depend on the specific objectives of a given problem. In other words, selecting different metric definitions allows for multiple topological inferences. In this work, we focus on applying persistent homology to music graph with predefined weights. We examine three distinct distance definitions based on edge-wise pathways and demonstrate how these definitions affect persistent barcodes, persistence diagrams, and birth/death edges. We found that there exist inclusion relations in one-dimensional persistent homology reflected on persistence barcode and diagram among these three distance definitions. We verified these findings using real music data.

We propose a geometry topological framework to analyze storm dynamics by coupling persistent homology with Anti-de Sitter (AdS)-inspired metrics. On radar images of a bow echo event, we compare Euclidean distance with three compressive AdS metrics (α = 0.01, 0.1, 0.3) via time-resolved H1 persistence diagrams for the arc and its internal cells. The moderate curvature setting (α=0.1) offers the best trade-off: it suppresses spurious cycles, preserves salient features, and stabilizes lifetime distributions. Consistently, the arc exhibits longer, more dispersed cycles (large-scale organizer), while cells show shorter, localized patterns (confined convection). Cross-correlations of H1 lifetimes reveal a temporal asymmetry: arc activation precedes cell activation. A differential indicator Δ(t) based on Wasserstein distances quantifies this divergence and aligns with the visual onset in radar, suggesting early warning potential. Results are demonstrated on a rapid Corsica bow echo; broader validation remains future work.

This study proposes a new approach that investigates differences in topological characteristics of visual networks, which are constructed using fMRI BOLD time-series corresponding to visual datasets of COCO, ImageNet, and SUN. A publicly available BOLD5000 dataset is utilized that contains fMRI scans while viewing 5254 images of diverse complexities. The objective of this study is to examine how network topology differs in response to distinct visual stimuli from these visual datasets. To achieve this, 0- and 1-dimensional persistence diagrams are computed for each visual network representing COCO, ImageNet, and SUN. For extracting suitable features from topological persistence diagrams, K-means clustering is executed. The extracted K-means cluster features are fed to a novel deep-hybrid model that yields accuracy in the range of 90-95% in classifying these visual networks. To understand vision, this type of visual network categorization across visual datasets is important as it captures differences in BOLD signals while perceiving images with different contexts and complexities. Furthermore, distinctive topological patterns of visual network associated with each dataset, as revealed from this study, could potentially lead to the development of future neuroimaging biomarkers for diagnosing visual processing disorders like visual agnosia or prosopagnosia, and tracking changes in visual cognition over time.

We propose a nested ensemble learning framework that utilizes Topological Data Analysis (TDA) to extract and integrate topological features from graph data, with the goal of improving performance on classification and regression tasks. Our approach computes persistence diagrams (PDs) using lower-star filtrations induced by three filter functions: closeness, betweenness, and degree 2 centrality. To overcome the limitation of relying on a single filter, these PDs are integrated through a data-driven, three-level architecture. At Level-0, diverse base models are independently trained on the topological features extracted for each filter function. At Level-1, a meta-learner combines the predictions of these base models for each filter to form filter-specific ensembles. Finally, at Level-2, a meta-learner integrates the outputs of these filter-specific ensembles to produce the final prediction. We evaluate our method on both simulated and real-world graph datasets. Experimental results demonstrate that our framework consistently outperforms base models and standard stacking methods, achieving higher classification accuracy and lower regression error. It also surpasses existing state-of-the-art approaches, ranking among the top three models across all benchmarks.

Abstract: Quantum Topological Data Analysis (QTDA) is introduced as a hybrid classical–quantum methodology for accelerating persistent homology on complex manifolds while preserving topological interpretability. The approach encodes simplicial complexes into quantum states, applies boundary operators via unitary transforms, and estimates invariants with variational and linear‑algebraic quantum routines. An end‑to‑end pipeline is formalized that couples deep representation learning with quantum‑assisted homological primitives, yielding stable persistence diagrams aligned with structural robustness. Experiments on synthetic and semi‑synthetic filtrations quantify latency, scaling, and stability, showing empirical reductions in runtime growth under modest qubit budgets. The results indicate that QTDA enables time‑critical analytics such as anomaly detection and manifold clustering, while meeting explainability and governance requirements through auditable topological summaries. Keywords Quantum Topological Data Analysis, persistent homology, Betti numbers, simplicial complexes, variational quantum algorithms, manifold learning, interpretability, auditability

We propose a strictly causal early–warning framework for financial crises based on topological signal extraction from multivariate return streams. Sliding windows of daily log–returns are mapped to point clouds, from which Vietoris–Rips persistence diagrams are computed and summarised by persistence landscapes. A single, interpretable indicator is obtained as the L2 norm of the landscape and passed through a causal decision rule (with thresholds α,β and run–length parameters s,t) that suppresses isolated spikes and collapses bursts to time–stamped warnings. On four major U.S. equity indices (S&P 500, NASDAQ, DJIA, Russell 2000) over 1999–2021, the method, at a fixed strictly causal operating point (α=β=3.1,s=57,t=16), attains a balanced precision–recall (F1≈0.50) with an average lead time of about 34 days. It anticipates two of the four canonical crises and issues a contemporaneous signal for the 2008 global financial crisis. Sensitivity analyses confirm the qualitative robustness of the detector, while comparisons with permissive spike rules and volatility–based baselines demonstrate substantially fewer false alarms at comparable recall. The approach delivers interpretable topology–based warnings and provides a reproducible route to combining persistent homology with causal event detection in financial time series.

A new filter for deformation-invariant persistence diagram

A geometric condition for uniqueness of Fréchet means of persistence diagrams

Diagnosing neuropsychiatric systemic lupus erythematosus (NPSLE) and differentiating it from systemic lupus erythematosus (SLE) without neuropsychiatric manifestations remains a substantial clinical challenge due to the absence of specific biomarkers. Topological data analysis (TDA) is a novel computational technique that enables the visualization, exploration, and analysis of complex data structures. This study aimed to identify distinct neuroimaging biomarkers in patients with NPSLE (NPSLE group) and differentiate them from patients with SLE without neuropsychiatric symptoms (non-NPSLE group) by employing TDA. We conducted a retrospective cohort study involving 30 patients with NPSLE and 30 without neuropsychiatric symptoms between 2005 and 2020. TDA was utilized to extract topological features, specifically connected components and holes, from fluid-attenuated inversion recovery (FLAIR) sequences obtained via brain magnetic resonance imaging (MRI). Summary statistics, including critical point count, persistence lifetime, centroid coordinates, perimeter, area, and filamentarity, were derived from persistence diagrams. Multiple logistic regression analyses, adjusted for age, cerebrovascular comorbidities, and 50% hemolytic unit of complement levels, demonstrated a significant association between NPSLE and the perimeter of the holes (odds ratio [OR]: 1.67, 95% confidence interval [CI]: 1.07-2.63, p = 0.025) and the area of the holes (OR: 4.42, 95% CI: 1.35-19.6, p = 0.026) of the identified topological features. Additionally, both areas under the receiver operating characteristic curve (AUC) exceeded 0.8, indicating good diagnostic accuracy. This study identified novel neuroimaging biomarkers for the diagnosis of NPSLE. The application of TDA to brain MRI features in patients with SLE proved to be a valuable diagnostic tool, particularly through the analysis of persistence diagrams.

This paper uses topological data analysis (TDA) tools and introduces a data-driven clustering-based stock selection strategy tailored for sparse portfolio construction. Our asset selection strategy exploits the topological features of stock price movements to select a subset of topologically similar (different) assets for a sparse index tracking (Markowitz) portfolio. We introduce new distance measures, which serve as an input to the clustering algorithm, on the space of persistence diagrams and landscapes that consider the time component of a time series. We conduct an empirical analysis on the S&P index from 2009 to 2022, including a study on the COVID-19 data to validate the robustness of our methodology. Our strategy to integrate TDA with the clustering algorithm significantly enhanced the performance of sparse portfolios across various performance measures in diverse market scenarios.

Erratum: “Edit Distance and Persistence Diagrams over Lattices”

Abstract: Graph labeling is an approach to systematically labeling the vertices of a graph with numerical labels, thus shedding light on such basic structural and combinatorial features. At the same time, Topological Data Analysis (TDA) has emerged as a powerful paradigm for the extraction of high-dimensional data's topological invariants with tools like persistent homology. This paper introduces a new fusion of graph labeling techniques with the TDA paradigm to enhance the extraction and utilization of topological features in machine learning. A new family of labelings, specifically designed to preserve the topological features and obey the persistence structure of graph filtrations, is presented. Promising strategies, like edge-weighted magic labelings and cycle-preserving vertex labelings, are constructed and analyzed. Analytical findings determine the conditions under which these labelings produce persistence diagrams showing stability under data perturbations. Experiments on synthetic and state-of-the-art benchmark datasets demonstrate that topology-aware labelings dramatically enhance the discriminative ability of TDA-based machine learning models. This paper unifies discrete labeling theory and computational topology, thus offering an new paradigm for the extraction of stable topological features from structured data.