Related papers: Simplification of complexes for persistent homolog…
Computing the state-space topology of a dynamical system from scalar data requires accurate reconstruction of those dynamics and construction of an appropriate simplicial complex from the results. The reconstruction process involves a…
Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a…
We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets. Starting from a finite metric space, we associate a filtration of finite topologies whose structure maps are…
We compute the cohomology groups of the spaces of colorings of cycles, i.e., of the prodsimplicial complexes Hom(C_m,K_n). We perform the computation first with Z_2, and then with integer coefficients. The main technical tool is to use…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…
Persistent homology theory is a relatively new but powerful method in data analysis. Using simplicial complexes, classical persistent homology is able to reveal high dimensional geometric structures of datasets, and represent them as…
A central problem in data-driven scientific inquiry is how to interpret structure in noisy, high-dimensional data. Topological data analysis (TDA) provides a solution via persistent homology, which encodes features of interest as…
An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of…
We study the problem of finding a minimum homology basis, that is, a lightest set of cycles that generates the $1$-dimensional homology classes with $\mathbb{Z}_2$ coefficients in a given simplicial complex $K$. This problem has been…
Computational topology provides a tool, persistent homology, to extract quantitative descriptors from structured objects (images, graphs, point clouds, etc). These descriptors can then be involved in optimization problems, typically as a…
We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a…
A central problem in topological data analysis is that of computing the homology of a given simplicial complex. Said complexes can have arbitrary large number of simplices, as can happen, for example, if the space is the Rips-Vietoris or…
We translate the operations of polarization and depolarization from monomial ideals in a polynomial ring to abstract simplicial complexes. As a result, we explicitly describe the relation between the Koszul simplicial complex of a monomial…
A suitable feature representation that can both preserve the data intrinsic information and reduce data complexity and dimensionality is key to the performance of machine learning models. Deeply rooted in algebraic topology, persistent…
Efficient computation of shortest cycles which form a homology basis under $\mathbb{Z}_2$-additions in a given simplicial complex $\mathcal{K}$ has been researched actively in recent years. When the complex $\mathcal{K}$ is a weighted graph…
This expository article presents a self-contained introduction to simplicial homology for finite simplicial complexes, emphasizing concrete computation and geometric intuition. Beginning with orientations of simplices and the construction…
We study the foundational properties of persistent homotopy groups and develop elementary computational methods for their analysis. Our main theorems are persistent analogues of the Van Kampen, excision, suspension, and Hurewicz theorems.…
Topological Data Analysis has grown in popularity in recent years as a way to apply tools from algebraic topology to large data sets. One of the main tools in topological data analysis is persistent homology. This paper uses undergraduate…
We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of,…