Related papers: Interleaving Distances, Monoidal Actions and 2-Cat…
A time-delay embedding (TDE), grounded in the framework of Takens's Theorem, provides a mechanism to represent and analyze the inherent dynamics of time-series data. Recently, topological data analysis (TDA) methods have been applied to…
Topological Data Analysis (TDA) is a field that leverages tools and ideas from algebraic topology to provide robust methods for analysing geometric and topological aspects of data. One of the principal tools of TDA, persistent homology,…
Topological Data Analysis (TDA) is a novel, and relatively new approach to analysing high-dimensional data sets. It does this by focussing on global properties like the shape and connectivity of the data giving it a significant advantage…
A central challenge in hydrodynamic turbulence is identifying precisely when, and at which length scales, strong turbulent fluctuations (STFs) emerge and develop into intermittent events, which are often obscured by conventional statistical…
Most Machine Learning (ML) methods, from clustering to classification, rely on a distance function to describe relationships between datapoints. For complex datasets it is hard to avoid making some arbitrary choices when defining a distance…
Developing reliable methods to discriminate different transient brain states that change over time is a key neuroscientific challenge in brain imaging studies. Topological data analysis (TDA), a novel framework based on algebraic topology,…
In this chapter, we discuss applications of topological data analysis (TDA) to spatial systems. We briefly review the recently proposed level-set construction of filtered simplicial complexes, and we then examine persistent homology in two…
Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the…
Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…
The persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer was recently generalized by Patel to the case of constructible persistence modules with values in a symmetric monoidal category with images. Patel also introduced a distance…
Comparison of graph structure is a ubiquitous task in data analysis and machine learning, with diverse applications in fields such as neuroscience, cyber security, social network analysis, and bioinformatics, among others. Discovery and…
Geodesic distance serves as a reliable means of measuring distance in nonlinear spaces, and such nonlinear manifolds are prevalent in the current multimodal learning. In these scenarios, some samples may exhibit high similarity, yet they…
In this paper, we introduce the persistence transformation, a novel methodology in Topological Data Analysis (TDA) for applications in time series data which can be obtained in various areas such as science, politics, economy, healthcare,…
Time-delay embedding is a fundamental technique in Topological Data Analysis (TDA) for reconstructing the phase space dynamics of time-series data. Persistent homology effectively identifies global topological features, such as loops…
Dimensionality reduction techniques are powerful tools for data preprocessing and visualization which typically come with few guarantees concerning the topological correctness of an embedding. The interleaving distance between the…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
Machine learning models for repeated measurements are limited. Using topological data analysis (TDA), we present a classifier for repeated measurements which samples from the data space and builds a network graph based on the data topology.…
This paper introduces the induced matching distance, a novel topological metric designed to compare discrete structures represented by a symmetric non-negative function. We apply this notion to analyze agent trajectories over time. We use…
Topological data analysis (TDA), as a relatively recent approach, has demonstrated great potential in capturing the intrinsic and robust structural features of complex data. While persistent homology, as a core tool of TDA, focuses on…
Persistent homology is a tool from Topological Data Analysis (TDA) used to summarize the topology underlying data. It can be conveniently represented through persistence diagrams. Observing a noisy signal, common strategies to infer its…