Topological Data Analysis for Multivariate Time Series Data.

Abstract: Neurodegenerative diseases, such as Alzheimer's and Parkinson's, are characterized by progressive neuronal deterioration, leading to cognitive and motor impairments. Early detection is crucial for effective intervention and management. This study proposes a novel framework utilizing Topological Data Analysis (TDA), particularly persistent homology, to identify early biomarkers from neuroimaging and physiological data. This study explores the application of TDA techniques—specifically persistent homology and topological invariants—for the early detection of neurodegenerative diseases such as Alzheimer's. By analyzing functional brain connectivity, gait dynamics, and molecular structures associated with disease progression, the research demonstrates that TDA can capture subtle, yet critical, topological signatures indicative of early neurodegenerative changes. Layer-wise topological complexity in neural networks and persistent homology in clinical datasets reveal distinct structural degradation patterns. The integration of TDA with machine learning models enhances diagnostic accuracy, interpretability, and generalization, offering a promising direction for non-invasive, data-driven diagnostics in neurology.By capturing the intrinsic topological features of brain networks, the framework aims to distinguish between healthy and early-stage neurodegenerative conditions, offering a robust tool for early diagnosis.Topological Data Analysis (TDA) offers a robust mathematical framework for extracting shape-based features from high-dimensional and noisy biomedical data. Keywords: Topological Data Analysis, Persistent Homology, Neurodegenerative Disease, Alzheimer's, Brain Connectivity, Early Diagnosis, Betti Numbers, Gait Analysis, Functional Networks, Machine Learning, Biomedical Data

BackgroundAttention-deficit/hyperactivity disorder (ADHD) is currently diagnosed by a diagnostic interview, mainly based on subjective reports from parents or teachers. It is necessary to develop methods that rely on objectively measureable neurobiological data to assess brain-behavior relationship in patients with ADHD. We investigated the application of a topological data analysis tool, Mapper, to analyze the brain functional connectivity data from ADHD patients.MethodsTo quantify the disease severity using the neuroimaging data, the decomposition of individual functional networks into normal and disease components by the healthy state model (HSM) was performed, and the magnitude of the disease component (MDC) was computed. Topological data analysis using Mapper was performed to distinguish children with ADHD (n = 196) from typically developing controls (TDC) (n = 214).ResultsIn the topological data analysis, the partial clustering results of patients with ADHD and normal subjects were shown in a chain-like graph. In the correlation analysis, the MDC showed a significant increase with lower intelligence scores in TDC. We also found that the rates of comorbidity in ADHD significantly increased when the deviation of the functional connectivity from HSM was large. In addition, a significant correlation between ADHD symptom severity and MDC was found in part of the dataset.ConclusionsThe application of HSM and topological data analysis methods in assessing the brain functional connectivity seem to be promising tools to quantify ADHD symptom severity and to reveal the hidden relationship between clinical phenotypic variables and brain connectivity.

Topological methods are very rarely used in structural health monitoring (SHM), or indeed in structural dynamics generally, especially when considering the structure and topology of observed data. Topological methods can provide a way of proposing new metrics and methods of scrutinising data, that otherwise may be overlooked. In this work, a method of quantifying the shape of data, via a topic called topological data analysis will be introduced. The main tool within topological data analysis is persistent homology. Persistent homology is a method of quantifying the shape of data over a range of length scales. The required background and a method of computing persistent homology is briefly introduced here. Ideas from topological data analysis are applied to a Z24 Bridge case study, to scrutinise different data partitions, classified by the conditions at which the data were collected. A metric, from topological data analysis, is used to compare between the partitions. The results presented demonstrate that the presence of damage alters the manifold shape more significantly than the effects present from temperature.

Topological Data Analysis (TDA) and its mainstay computational device, persistent homology (PH), has established a strong track record of providing researchers across the data-driven sciences with new insights and methodologies by characterizing low-dimensional geometric structures in high-dimensional data. When combined with machine learning (ML) methods, PH is valued as a discriminating-feature extraction tool. This work highlights many of the recent successes at the intersection of TDA and ML, introduces some of the foundational mathematics underpinning TDA, and summarizes the efforts to strengthen the bridge between TDA and ML. Thus, this document is a launching point for experimentalists and theoreticians to consider what can be learned from the shape of their data.

Topological Data Analysis is a set of mathematical methods for capturing the structure of data forms. TDA has been used to cope with noisy signals and time series. TDA is used to discover the key characteristics of data, which are shapes. One of the basic techniques for TDA is persistent homology which is used to do a study of time series and signal processing. Human activity analysis is a well-researched issue in the field of vision, with large research on the topic. The produced time- series data is typically high-dimensional, intrinsic, non-linear, and non-stationary, leading to pattern changes. The data acquired by a person’s numerous sensors, as well as their placement and orientation, often produces noisy and complicated data, resulting in poor model performance. The implementation method must be data-driven, independent of sensor location and orientation, and employ a coordinate and parameter-free strategy to identify the variable time series data. We need technology that can represent a low-dimensional manifold compactly, identify emergent behaviors, and globalize the system. The persistent homology having property being co- ordinate free. Sensor placement has little effect on time series factorization using persistent homology. This paper gives an overview of topological approaches as well as the problems of human activity analysis, as well as recommendations for the future.

Single-cell technologies have revolutionized our ability to interrogate biological systems at unprecedented resolution, revealing complex cellular heterogeneity and dynamic processes that underlie development, disease, and immune responses. However, the high dimensionality and nonlinear structure of single-cell data present substantial analytical challenges. Topological data analysis offers a powerful mathematical framework for capturing the intrinsic shape of data, providing novel insights that complement and extend traditional statistical and machine learning methods. By leveraging tools such as persistent homology and the Mapper algorithm, TDA enables the detection of subtle, multiscale patterns – including rare cell populations, transitional states, and branching trajectories – that are often obscured by conventional approaches. In this review, we explore the theoretical foundations of topological data analysis and examine its emerging applications across single-cell transcriptomics, proteomics, and spatial biology. We highlight how this approach can unveil previously unrecognized biological phenomena, from alternative differentiation paths to complex tissue architectures, and discuss the growing ecosystem of computational tools that support its use. As single-cell datasets become increasingly large and multimodal, topological data analysis stands out as a uniquely robust and interpretable approach, with the potential to deepen our understanding of cellular identity and function in health and disease. TDA is specially suited for fields such as systems immunology since it can capture the complex, nonlinear structures inherent in high-dimensional immune data helping to identify distinct immune cell states, differentiation pathways, and dynamic responses to infection or therapy. This topological perspective complements traditional statistical approaches, providing a robust, scale-invariant framework for uncovering hidden organization within the immune system’s complexity.

Topological data analysis and its main method, persistent homology, provide a toolkit for computing topological information of high-dimensional and noisy data sets. Kernels for one-parameter persistent homology have been established to connect persistent homology with machine learning techniques with applicability on shape analysis, recognition and classification. We contribute a kernel construction for multi-parameter persistence by integrating a one-parameter kernel weighted along straight lines. We prove that our kernel is stable and efficiently computable, which establishes a theoretical connection between topological data analysis and machine learning for multivariate data analysis.

• A novel foundation for topological pattern recognition of point cloud data, through persistent homology of graph approximations. • An extension of persistent homology to point cloud data of metric trees, including theoretical and experimental verification. • The first charting of cell trajectory data sets that explains some of the difficulties this field is confronted with. The rising field of Topological Data Analysis (TDA) provides a new approach to learning from data through persistence diagrams , which are topological signatures that quantify topological properties of data in a comparable manner. For point clouds, these diagrams are often derived from the Vietoris-Rips filtration—based on the metric equipped on the data—which allows one to deduce topological patterns such as components and cycles of the underlying space. In metric trees these diagrams often fail to capture other crucial topological properties, such as the present leaves and multifurcations. Prior methods and results for persistent homology attempting to overcome this issue mainly target Rips graphs, which are often unfavorable in case of non-uniform density across our point cloud. We therefore introduce a new theoretical foundation for learning a wider variety of topological patterns through any given graph . Given particular powerful functions defining persistence diagrams to summarize topological patterns, including the normalized centrality or eccentricity , we prove a new stability result, explicitly bounding the bottleneck distance between the true and empirical diagrams for metric trees. This bound is tight if the metric distortion obtained through the graph and its maximal edge-weight are small. Through a case study of gene expression data, we demonstrate that our newly introduced diagrams provide novel quality measures and insights into cell trajectory inference.

In this paper we develop an alternative topological data analysis (TDA) approach for studying graph representations of time series of dynamical systems. Specifically, we show how persistent homology, a tool from TDA, can be used to yield a compressed, multi-scale representation of the graph that can distinguish between dynamic states such as periodic and chaotic behavior. We show the approach for two graph constructions obtained from the time series. In the first approach the time series is embedded into a point cloud which is then used to construct an undirected k-nearest-neighbor graph. The second construct relies on the recently developed ordinal partition framework. In either case, a pairwise distance matrix is then calculated using the shortest path between the graph's nodes, and this matrix is utilized to define a filtration of a simplicial complex that enables tracking the changes in homology classes over the course of the filtration. These changes are summarized in a persistence diagram's two-dimensional summary of changes in the topological features. We then extract existing as well as new geometric and entropy point summaries from the persistence diagram and compare to other commonly used network characteristics. Our results show that persistence-based point summaries yield a clearer distinction of the dynamic behavior and are more robust to noise than existing graph-based scores, especially when combined with ordinal graphs.

Most survival models assume no autocorrelation between objects and time-independence. However, in many cases of disease spread, an object can potentially affect its neighbors, and the feature may change over time. To address these issues, we implemented persistent homology, a topological data analysis (TDA) approach, to handle the problems of correlated and longitudinal data. We applied this to the case of the first infection time of COVID-19 in each province in Indonesia, using the human mobility index as a feature. The results show that survival models with persistent homology achieved a higher C-Index than those without persistent homology.

The natural pseudo-distance \(d_G\) associated with a group G of self-homeomorphisms of a topological space X is a pseudo-metric developed to compare real-valued functions defined on X, when the equivalence between functions is expressed by the group G. In this paper, we illustrate \(d_G\), its role in topological data analysis, its main properties and its link with persistent homology.

Topological data analysis is a family of recent mathematical techniques seeking to understand the ‘shape’ of data, and has been used to understand the structure of the descriptor space produced from a standard chemical informatics software from the point of view of solubility. We have used the mapper algorithm, a TDA method that creates low-dimensional representations of data, to create a network visualization of the solubility space. While descriptors with clear chemical implications are prominent features in this space, reflecting their importance to the chemical properties, an unexpected and interesting correlation between chlorine content and rings and their implication for solubility prediction is revealed. A parallel representation of the chemical space was generated using persistent homology applied to molecular graphs. Links between this chemical space and the descriptor space were shown to be in agreement with chemical heuristics. The use of persistent homology on molecular graphs, extended by the use of norms on the associated persistence landscapes allow the conversion of discrete shape descriptors to continuous ones, and a perspective of the application of these descriptors to quantitative structure property relations is presented.

Persistent homology is a fundamental tool in topological data analysis used for the most diverse applications. Information captured by persistent homology is commonly visualized using scatter plots representations. Despite being widely adopted, such a visualization technique limits user understanding and is prone to misinterpretation. This article proposes a new approach for the efficient computation of persistence cycles, a geometric representation of the features captured by persistent homology. We illustrate the importance of rendering persistence cycles when analyzing scalar fields, and we discuss the advantages that our approach provides compared to other techniques in topology-based visualization. We provide an efficient implementation of our approach based on discrete Morse theory, as a new module for the Topology Toolkit. We show that our implementation has comparable performance with respect to state-of-the-art toolboxes while providing a better framework for visually analyzing persistent homology information.

This chapter describes a new approach for studying the stability of stochastic delay equations by investigating their time series using topological data analysis (TDA). The approach is illustrated utilizing two stochastic delay equations. The first model equation is the stochastic version of Hayes equation—a scalar autonomous delay equation—where the noise is an additive term. The second model equation is the stochastic version of Mathieu’s equation—a time-periodic delay equation. In the latter, noise is added via a multiplicative term in the time-periodic coefficient. The time series is generated using Euler–Maruyama method and a corresponding point cloud is obtained using the Takens’ embedding. The point cloud is then analyzed using a tool from TDA known as persistent homology. The results of this study show that the described approach can be used for analyzing datasets of delay dynamical systems that are described using constant as well as time-periodic coefficients. The presented approach can be used for signals generated from both numerical simulation and experiments. It can be used as a tool to study the stability of stochastic delay equations for which there are currently a limited number of analysis tools.

Topological data analysis (TDA) is an active field of mathematics for quantifying shape in complex data. Standard methods in TDA such as persistent homology (PH) are typically focused on the analysis of data consisting of a single entity (e.g., cells or molecular species). However, state-of-the-art data collection techniques now generate exquisitely detailed multispecies data, prompting a need for methods that can examine and quantify the relations among them. Such heterogeneous data types arise in many contexts, ranging from biomedical imaging, geospatial analysis, to species ecology. Here, we propose two methods for encoding spatial relations among different data types that are based on Dowker complexes and Witness complexes. We apply the methods to synthetic multispecies data of a tumor microenvironment and analyze topological features that capture relations between different cell types, e.g., blood vessels, macrophages, tumor cells, and necrotic cells. We demonstrate that relational topological features can extract biological insight, including the dominant immune cell phenotype (an important predictor of patient prognosis) and the parameter regimes of a data-generating model. The methods provide a quantitative perspective on the relational analysis of multispecies spatial data, overcome the limits of traditional PH, and are readily computable.