The aim of this article is to describe a new perspective on functoriality of persistent homology and explain its intrinsic symmetry that is often overlooked. A data set for us is a finite collection of functions, called measurements, with a finite domain. Such a data set might contain internal symmetries which are effectively captured by the action of a set of the domain endomorphisms. Different choices of the set of endomorphisms encode different symmetries of the data set. We describe various category structures on such enriched data sets and prove some of their properties such as decompositions and morphism formations. We also describe a data structure, based on coloured directed graphs, which is convenient to encode the mentioned enrichment. We show that persistent homology preserves only some aspects of these landscapes of enriched data sets however not all. In other words persistent homology is not a functor on the entire category of enriched data sets. Nevertheless we show that persistent homology is functorial locally. We use the concept of equivariant operators to capture some of the information missed by persistent homology.
In this paper we prove that every Khovanov homology associated to a Frobenius algebra of rank $2$ can be modified in such a way as to produce a TQFT on oriented links, that is a monoidal functor from the category of cobordisms of oriented links to the homotopy category of complexes.
We follow the same technics we used before in \cite{AZ} of extending knot Floer homology to embedded graphs in a 3-manifold, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local replacements at each vertex in the graph. This new concept of Graph Floer homology constructed to be the sum of the knot Floer homologies of all the links and knots associated to this graph and the Euler characteristic is the sum of all the Alexander polynomials of links in the family. We constructed three pre-additive categories one…
We show that the interleaving distance between the persistent singular homology and the persistent Čech homology of a homologically locally connected filtration consisting of paracompact Hausdorff spaces is 0.
In this paper, we study further properties and applications of weighted homology and persistent homology. We introduce the Mayer-Vietoris sequence and generalized Bockstein spectral sequence for weighted homology. For applications, we show an algorithm to construct a filtration of weighted simplicial complexes from a weighted network. We also prove a theorem that allows us to calculate the mod $p^2$ weighted persistent homology given some information on the mod $p$ weighted persistent homology.
In this paper we develop the theory of weighted persistent homology. In 1990, Robert J. Dawson was the first to study in depth the homology of weighted simplicial complexes. We generalize the definitions of weighted simplicial complex and the homology of weighted simplicial complex to allow weights in an integral domain $R$. Then we study the resulting weighted persistent homology. We show that weighted persistent homology can tell apart filtrations that ordinary persistent homology does not distinguish. For example, if there is a point considered as special, weighted persistent homology can t…
A recent result on size functions is extended to higher homology modules: the persistent homology based on a multidimensional measuring function is reduced to a 1-dimensional one. This leads to a stable distance for multidimensional persistent homology. Some reflections on i-essentiality of homological critical values conclude the paper.
We prove an extension to the simplicial Nerve Lemma which establishes isomorphism of persistent homology groups, in the case where the covering spaces are filtered. While persistent homology is now widely used in topological data analysis, the usual Nerve Lemma does not provide isomorphism of persistent homology groups. Our argument involves some homological algebra: the key point being that although the maps produced in the standard proof of the Nerve Lemma do not commute as maps of chain complexes, the maps they induce on homology do.
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy invariance of the introduced path homology groups. We provide examples of computation of these homology groups.
The Euler calculus -- an integral calculus based on Euler characteristic as a valuation on constructible functions -- is shown to be an incisive tool for answering questions about injectivity and invertibility of recent transforms based on persistent homology for shape characterization.
Hypergraph is the most general model for complex networks involving group interactions. Taking the ideas of path homology from Alexander Grigor'yan, Yong Lin, Yuri Muranov and Shing-Tung Yau [18-22], Stephane Bressan, Jingyan Li and the authors of this article introduced embedded homology of hypergraphs [6] in 2019, which has leaded to successful applications in protein-ligand binding network [24, 25] in 2021. A fundamental question arising from practical applications is about the stability of the persistent embedded homology of hypergraphs. In this paper, we prove the stability of the persist…
This paper is a survey of persistent homology, primarily as it is used in topological data analysis. It includes the theory of persistence modules, as well as stability theorems for persistence barcodes, generalized persistence, vectorization of persistence barcodes, as well as some applications.
We demonstrate that an excision property holds for persistent homology groups. This property holds for a large class of filtrations, and in fact we show that given any filtration on a larger space, we can extend it to a filtration of two subspaces which guarantees that the excision property holds for the triple. This method also applies to the Mayer-Vietoris sequence in persistent homology introduced by DiFabio and Landi in 2011, extending their results to a much larger class of filtrations.
Persistent magnitude homology on finite metric space
Chongqing University of Technology（重庆理工大学）；University of North Carolina at Charlotte（北卡罗来纳大学夏洛特分校）；Yanqi Lake Beijing Institute of Mathematical Sciences and Applications（北京国际数学研究中心）
Computation of degree-1 persistent homology on larger point-clouds using the Reduced Vietoris-Rips filtration
Australian National University（澳大利亚国立大学）；Centre for Systems Biology Dresden（德累斯顿系统生物学中心）；Max Planck Institute of Cell Biology and Genetics（马克斯·普朗克细胞生物学与遗传学研究所）；Max Planck institute for the Physics of Complex Systems（马克斯·普朗克复杂系统物理研究所）
While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We study a construction of homology of digraphs due to Grigor'yan, Lin, Muranov and Yau, and extend this construction to the persistent framework. The result, which we call persistent path homology, can provide information about the digraph structure of a directed network at varying resolutions. Moreover, this method encodes a rich level of detail about the asymmetric structu…
In recent years, A. Grigor'yan, Y. Lin, Y. Muranov and S.T. Yau [6, 7, 8, 9] constructed a path homology theory for digraphs. Later, S. Chowdhury and F. Memoli [3] studied the persistent path homology for directed networks. In this paper, we generalize the path homology theory for digraphs and construct a weighted path homology for weighted digraphs. We study the persistent weighted path homology for weighted digraphs and detect the effects of the weights on the persistent weighted path homology. We prove a persistent version of a Kunneth-type formula for joins of weighted digraphs.
Persistent homology is a branch of computational algebraic topology that studies shapes and extracts features over multiple scales. In this paper, we present an unsupervised approach that uses persistent homology to study divergent behavior in agricultural point cloud data. More specifically, we build persistence diagrams from multidimensional point clouds, and use those diagrams as the basis to compare and contrast different subgroups of the population. We apply the framework to study the cold hardiness behavior of 5 leading grape cultivars, with real data from over 20 growing seasons. Our re…
Persistent homology has recently emerged as a powerful technique in topological data analysis for analyzing the emergence and disappearance of topological features throughout a filtered space, shown via persistence diagrams. Additionally, (co)sheaves have proven to be powerful instruments in tracking locally defined data across global systems, resulting in innovative applications to network science. In this paper, we combine the topological results of persistent homology and the quantitative data tracking capabilities of cosheaf theory to develop novel techniques in network data flow analysis.…
We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the Matrix Structural Theorem. Any of the various algorithms for computing persistent homology constitutes a constructive proof of the Matrix Structural Theorem. We showthat the Matrix Structural Theorem is equivalent to the Krull-Schmidt property of the category of filtered chain complexes. We separately establish the Krull-Schmidt property by abstract categorica…
We introduce weighted versions of the classical Čech and Vietoris-Rips complexes. We show that a version of the Vietoris-Rips Lemma holds for these weighted complexes and that they enjoy appropriate stability properties. We also give some preliminary applications of these weighted complexes.
Consider the space of continuous functions on a geometric tree $X$ whose persistent homology gives rise to a finite generic barcode $D$. We show that there are exactly as many path connected components in this space as there are merge trees whose barcode is $D$. We find that each component is homotopy equivalent to a configuration space on $X$ with specialized constraints encoded by the merge tree. For barcodes $D$ with either one or two intervals, our method also allows us to compute the homotopy type of this space of functions.
This paper introduces persistent homology, which is a powerful tool to characterize the shape of data using the mathematical concept of topology. We explain the fundamental idea of persistent homology from scratch using some examples. We also review some applications of persistent homology to materials researches and software for persistent homology data analysis. HomCloud, one of persistent homology software, is especially featured in this paper.
Topological data analysis combines machine learning with methods from algebraic topology. Persistent homology, a method to characterize topological features occurring in data at multiple scales is of particular interest. A major obstacle to the wide-spread use of persistent homology is its computational complexity. In order to be able to calculate persistent homology of large datasets, a number of approximations can be applied in order to reduce its complexity. We propose algorithms for calculation of approximate sparse nerves for classes of Dowker dissimilarities including all finite Dowker d…
Graph-based representations of point-cloud data are widely used in data science and machine learning, including epsilon-graphs that contain edges between pairs of data points that are nearer than epsilon and kNN-graphs that connect each point to its k-nearest neighbors. Recently, topological data analysis has emerged as a family of mathematical and computational techniques to investigate topological features of data using simplicial complexes. These are a higher-order generalization of graphs and many techniques such as Vietoris-Rips (VR) filtrations are also parameterized by a distance epsilo…
The extension of persistent homology to multi-parameter setups is an algorithmic challenge. Since most computation tasks scale badly with the size of the input complex, an important pre-processing step consists of simplifying the input while maintaining the homological information. We present an algorithm that drastically reduces the size of an input. Our approach is an extension of the chunk algorithm for persistent homology (Bauer et al., Topological Methods in Data Analysis and Visualization III, 2014). We show that our construction produces the smallest multi-filtered chain complex among a…
Multidimensional persistence studies topological features of shapes by analyzing the lower level sets of vector-valued functions. The rank invariant completely determines the multidimensional analogue of persistent homology groups. We prove that multidimensional rank invariants are stable with respect to function perturbations. More precisely, we construct a distance between rank invariants such that small changes of the function imply only small changes of the rank invariant. This result can be obtained by assuming the function to be just continuous. Multidimensional stability opens the way t…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph theoretical operations. We use iterated Morse decomposition, which allows us to sidetrack many problems related to the standard discrete Morse theory. In particular, this approach is provably correct in any dimension.
We propose that the recently defined persistent homology dimensions are a practical tool for fractal dimension estimation of point samples. We implement an algorithm to estimate the persistent homology dimension, and compare its performance to classical methods to compute the correlation and box-counting dimensions in examples of self-similar fractals, chaotic attractors, and an empirical dataset. The performance of the $0$-dimensional persistent homology dimension is comparable to that of the correlation dimension, and better than box-counting.
Institute of Mathematics for Industry, Kyushu University（九州大学产业数学研究所）；School of Interdisciplinary Mathematical Sciences, Meiji University（明治大学跨学科数理科学学院）
We introduce Cubical Ripser for computing persistent homology of image and volume data (more precisely, weighted cubical complexes). To our best knowledge, Cubical Ripser is currently the fastest and the most memory-efficient program for computing persistent homology of weighted cubical complexes. We demonstrate our software with an example of image analysis in which persistent homology and convolutional neural networks are successfully combined. Our open-source implementation is available online.
The classical Künneth formula in algebraic topology describes the homology of a product space in terms of that of its factors. In this paper, we prove Künneth-type theorems for the persistent homology of the categorical and tensor product of filtered spaces. That is, we describe the persistent homology of these product filtrations in terms of that of the filtered components. In addition to comparing the two products, we present two applications in the setting of Vietoris-Rips complexes: one towards more efficient algorithms for product metric spaces with the maximum metric, and the other recov…
In this paper we extend the notion of the Euler characteristic to persistent homology and give the relationship between the Euler integral of a function and the Euler characteristic of the function's persistent homology. We then proceed to compute the expected Euler integral of a Gaussian random field using the Gaussian kinematic formula and obtain a simple closed form expression. This results in the first explicitly computable mean of a quantitative descriptor for the persistent homology of a Gaussian random field.
This paper aims to introduce a filtration analysis of sampled maps based on persistent homology, providing a new method for reconstructing the underlying maps. The key idea is to extend the definition of homology induced maps of correspondences using the framework of quiver representations. Our definition of homology induced maps is given by most persistent direct summands of representations, and the direct summands uniquely determine a persistent homology. We provide stability theorems of this process and show that the output persistent homology of the sampled map is the same as that of the u…
Given a metric space $X$ and a subspace $A\subset X$, we prove $A$ can generate various algebraic elements in persistent homology of $X$. We call such elements (algebraic) footprints of $A$. Our results imply that footprints typically appear in dimensions above the dimension of $A$. Higher-dimensional persistent homology thus encodes lower-dimensional geometric features of $X$. We pay special attention to a specific type of geodesics in a geodesic surface $X$ called geodesic circles. We explain how they may generate non-trivial odd-dimensional and two-dimensional footprints. In particular, we …
Persistent homology is a topological feature used in a variety of applications such as generating features for data analysis and penalizing optimization problems. We develop an approach to accelerate persistent homology computations performed on many similar filtered topological spaces which is based on updating associated matrix factorizations. Our approach improves the update scheme of Cohen-Steiner, Edelsbrunner, and Morozov for permutations by additionally handling addition and deletion of cells in a filtered topological space and by processing changes in a single batch. We show that the c…
We describe an approach to bounded-memory computation of persistent homology and betti barcodes, in which a computational state is maintained with updates introducing new edges to the underlying neighbourhood graph and percolating the resulting changes into the simplex stream feeding the persistence algorithm. We further discuss the memory consumption and resulting speed and complexity behaviours of the resulting algorithm.
We study the persistent homology of the data set of syntactic parameters of the world languages. We show that, while homology generators behave erratically over the whole data set, non-trivial persistent homology appears when one restricts to specific language families. Different families exhibit different persistent homology. We focus on the cases of the Indo-European and the Niger-Congo families, for which we compare persistent homology over different cluster filtering values. We investigate the possible significance, in historical linguistic terms, of the presence of persistent generators o…
We consider sequences of absolute and relative homology and cohomology groups that arise naturally for a filtered cell complex. We establish algebraic relationships between their persistence modules, and show that they contain equivalent information. We explain how one can use the existing algorithm for persistent homology to process any of the four modules, and relate it to a recently introduced persistent cohomology algorithm. We present experimental evidence for the practical efficiency of the latter algorithm.
