Summary
See homology for an introduction to the notation. Persistent homology is a method for computing topological features of a space at different spatial resolutions. More persistent features are detected over a wide range of spatial scales and are deemed more likely to represent true features of the underlying space rather than artifacts of sampling, noise, or particular choice of parameters. To find the persistent homology of a space, the space must first be represented as a simplicial complex. A distance function on the underlying space corresponds to a filtration of the simplicial complex, that is a nested sequence of increasing subsets. One common method of doing this is via taking the sublevel filtration of the distance to a point cloud, or equivalently, the offset filtration on the point cloud and taking its nerve in order to get the simplicial filtration known as Čech filtration. A similar construction uses a nested sequence of Vietoris-Rips complexes known as the Vietoris-Rips filtration. Formally, consider a real-valued function on a simplicial complex that is non-decreasing on increasing sequences of faces, so whenever is a face of in . Then for every the sublevel set is a subcomplex of K, and the ordering of the values of on the simplices in (which is in practice always finite) induces an ordering on the sublevel complexes that defines a filtration When , the inclusion induces a homomorphism on the simplicial homology groups for each dimension . The persistent homology groups are the images of these homomorphisms, and the persistent Betti numbers are the ranks of those groups. Persistent Betti numbers for coincide with the size function, a predecessor of persistent homology. Any filtered complex over a field can be brought by a linear transformation preserving the filtration to so called canonical form, a canonically defined direct sum of filtered complexes of two types: one-dimensional complexes with trivial differential and two-dimensional complexes with trivial homology .
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (3)
BIO-612: Mathematical methods for neuroscience
This course teaches basic mathematical techniques that can be applied on biological and neuroscience challenges. During the course we will focus on solving similarity tasks with stochastic systems, ra
MATH-688: Reading group in applied topology I
The focus of this reading group is to delve into the concept of the "Magnitude of Metric Spaces". This approach offers an alternative approach to persistent homology to describe a metric space across
MATH-645: Young Topologists Meeting Mini-Courses
We expect these mini-courses to equip junior researchers with new tools, techniques, and perspectives for attacking a broad range of questions in their own areas of research while also inspiring stude
Related lectures (8)
Higher-order Interactions in Brain Networks
Explores higher-order interactions in brain networks using simplicial complexes and information theory, analyzing data from fMRI, financial time-series, and infectious diseases.
Topological Data Science
Delves into Topological Data Analysis, exploring the shape of data and its underlying structure through mathematical tools and concepts.
Topological Data Science
Delves into Topological Data Analysis, emphasizing the mathematical foundations of neural networks and exploring the manifold hypothesis and persistent homology.
Show more
Related publications (16)

Topologically Better Delineation of Curvilinear Structures

Doruk Oner

Curvilinear structures are frequently observed in a variety of domains and are essential for comprehending neural circuits, detecting fractures in materials, and determining road and irrigation canal networks. It can be costly and time-consuming to manuall ...
EPFL2023
Show more
Related concepts (1)
Topological data analysis
In applied mathematics, topological data analysis (TDA) is an approach to the analysis of datasets using techniques from topology. Extraction of information from datasets that are high-dimensional, incomplete and noisy is generally challenging. TDA provides a general framework to analyze such data in a manner that is insensitive to the particular metric chosen and provides dimensionality reduction and robustness to noise. Beyond this, it inherits functoriality, a fundamental concept of modern mathematics, from its topological nature, which allows it to adapt to new mathematical tools.