Such modern applications of topology as data analysis and digital image analysis have to deal with noise and other uncertainty. In this environment, topological spaces often appear equipped with a real valued function. Persistence is a measure of robustness of the homology classes of the filtration of the lower level sets of this function. In this paper we introduce the homology group of filtration as the product of the kernels of the homology maps of the inclusions. This group contains all possible homology classes in all elements of the filtration so that we can later pick the features that lie within the user's choice of the acceptable level of noise.
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.
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.
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（马克斯·普朗克复杂系统物理研究所）
Computing extended persistent homology of radial distance filtrations of Euclidean shapes
Division of Applied Mathematics, Brown University（布朗大学应用数学系）；Research School of Physics, Australian National University（澳大利亚国立大学物理研究学院）；Mathematical Sciences Institute, Australian National University（澳大利亚国立大学数学科学研究所）
We introduce an intrinsic filtration to the magnitude chain complex of a metric space, and study basic properties of the associated spectral sequence of the magnitude homology. As an application, the third magnitude homology of the circle is computed.
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…
Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as "tournaplexes", whose simplices are tournaments. In particular, given a digraph $\mathcal{G}$, we associate with it a "flag tournaplex" which is a tournaplex containing the directed flag complex of $\mathcal{G}$, but also the geometric realisation of cliques that are not directed. We define several types of filtrations on tournaplexes, and exploiting persistent homology, we observe that flag tournaplexes provide finer means of distinguishing g…
We consider the rational vector space generated by all rational homology spheres up to orientation-preserving homeomorphism, and the filtration defined on this space by Lagrangian-preserving rational homology handlebody replacements. We identify the graded space associated with this filtration with a graded space of augmented Jacobi diagrams.
We define a functorial spectrum-level filtration on the topological Hochschild homology of any commutative ring spectrum $R$, and more generally the factorization homology $R \otimes X$ for any space $X$, echoing algebraic constructions of Loday and Pirashvili. We investigate the properties of this filtration and show that it breaks THH up into common eigenspectra of the Adams operations.
In this paper, we prove that both topological Hochschild homology and topological cyclic homology are sheaves for the fpqc topology on connective commutative ring spectra, by exploiting the May filtration on topological Hochschild homology.
Let $G/H$ be a homogeneous variety, and let $X$ be a $G$-equivariant embedding of $G/H$such that the number of $G$-orbits in $X$ is finite. We show that the equivariant Borel-Moore homology of $X$ has a filtration with associated graded module the direct sum of the equivariant Borel-Moore homologies of the $G$-orbits. If $T$ is a maximal torus of $G$ such that each $G$-orbit has a $T$-fixed point, then the equivariant filtration descends to give a filtration on the ordinary Borel-Moore homology of $X$. We apply our findings to certain wonderful compactifications as well as to double flag varie…
This technical report introduces a novel approach to efficient computation in homological algebra over fields, with particular emphasis on computing the persistent homology of a filtered topological cell complex. The algorithms here presented rely on a novel relationship between discrete Morse theory, matroid theory, and classical matrix factorizations. We provide background, detail the algorithms, and benchmark the software implementation in the Eirene package.
We identify the equivariant structure of the filtered pieces of the motivic filtration defined by Bhatt, Morrow and Scholze on the topological Hochschild cohomology spectrum of polynomial algebras over $\mathbb{F}_p$.
Topological data analysis is a recent and fast growing field that approaches the analysis of datasets using techniques from (algebraic) topology. Its main tool, persistent homology (PH), has seen a notable increase in applications in the last decade. Often cited as the most favourable property of PH and the main reason for practical success are the stability theorems that give theoretical results about noise robustness, since real data is typically contaminated with noise or measurement errors. However, little attention has been paid to what these stability theorems mean in practice. To gain s…
The persistent homology pipeline includes the reduction of a, so-called, boundary matrix. We extend the work of Bauer et al. (2014) and Chen et al. (2011) where they show how to use dependencies in the boundary matrix to adapt the reduction algorithm presented in Edelsbrunner et al. (2002) in such a way as to reduce its computational cost. Herein we present a number of additional dependencies in the boundary matrices and propose a novel parallel algorithms for the reduction of boundary matrices. In particular, we show: that part of the reduction is immediately apparent, give bounds on the redu…
In this paper, we study the equivariant homotopy type of a connected sum of linear actions on complex projective planes defined by Hambleton and Tanase. These actions are constructed for cyclic groups of odd order. We construct cellular filtrations on the connected sum using spheres inside unitary representations. A judicious choice of filtration implies a splitting on equivariant homology for general cyclic groups under a divisibility hypothesis, and in all cases for those of prime power order.
In this paper we examine certain filtrations of topological Hochschild homology and topological cyclic homology. As an example we show how the filtration with respect to a nilpotent ideal gives rise to an analog of a theorem of Goodwillie saying that rationally relative K-theory and relative cyclic homology agree. Our variation says that the p-torsion parts agree in a range of degrees. We use it to compute K_i(Z/p^m) for i < p-2.
In this paper we study the relationship between a very classical algebraic object associated to a filtration of spaces, namely a spectral sequence introduced by Leray in the 1940's, and a more recently invented object that has found many applications -- namely, its persistent homology groups. We show the existence of a long exact sequence of groups linking these two objects and using it derive formulas expressing the dimensions of each individual groups of one object in terms of the dimensions of the groups in the other object. The main tool used to mediate between these objects is the notion …
We let the mapping class group $Γ_{g,1}$ of a genus $g$ surface $Σ_{g,1}$ with one boundary component act on the homology $H_*(F_{n}(Σ_{g,1});\mathbb{Q})$ of the $n^{th}$ ordered configuration space of the surface. We prove that the action is non-trivial when restricted to the $(n-1)^{st}$ stage of the Johnson filtration, for all $n\ge 1$ and $g\ge 2$. We deduce an analogous result for closed surfaces.
We give an algorithm with singly exponential complexity for computing the barcodes up to dimension $\ell$ (for any fixed $\ell \geq 0$) of the filtration of a given semi-algebraic set by the sub-level sets of a given polynomial. Our algorithm is the first algorithm for this problem with singly exponential complexity, and generalizes the corresponding results for computing the Betti numbers up to dimension $\ell$ of semi-algebraic sets with no filtration present.
Persistent homology is a popular data analysis technique that is used to capture the changing topology of a filtration associated with some simplicial complex $K$. These topological changes are summarized in persistence diagrams. We propose two contraction operators which when applied to $K$ and its associated filtration, bound the perturbation in the persistence diagrams. The first assumes that the underlying space of $K$ is a $2$-manifold and ensures that simplices are paired with the same simplices in the contracted complex as they are in the original. The second is for arbitrary $d$-comple…
Pirashvili exhibited a small subcomplex of the Leibniz complex $(T(s \mathfrak{g}), d_{\mathrm{Leib}})$ of a Leibniz algebra $\mathfrak{g}$. The main result of this paper generalizes this result to show that the primitive filtration of $T(s\mathfrak{g})$ provides an increasing, exhaustive filtration of the Leibniz complex by subcomplexes, thus establishing a conjecture due to Loday. The associated spectral sequence is used to give a new proof of Pirashvili's conjecture that, when $\mathfrak{g}$ is a free Leibniz algebra, the homology of the Pirashvili complex is zero except in degree one. This…
For any group G, we define a new characteristic series related to the derived series, that we call the torsion-free derived series of G. Using this series and the Cheeger-Gromov rho-invariant, we obtain new real-valued homology cobordism invariants rho_n for closed (4k-1)-dimensional manifolds. For 3-dimensional manifolds, we show that {rho_n} is a linearly independent set and for each n, the image of rho_n is an infinitely generated and dense subset of R. In their seminal work on knot concordance, T. Cochran, K. Orr, and P. Teichner define a filtration F_(n)^m of the m-component (string) link…
Motif-based filtrations for persistent homology: A framework for graph isomorphism and property prediction
Center for Complex Networks and Systems Research, Luddy School of Informatics, Computing, and Engineering, Indiana University（印第安纳大学卢迪信息、计算与工程学院复杂网络与系统研究中心）；Delft University of Technology（代尔夫特理工大学）；Universitat de Barcelona（巴塞罗那大学）；Institute of Complex Systems (UBICS), Universitat de Barcelona（巴塞罗那大学复杂系统研究所）；ICREA（加泰罗尼亚高级研究院）
Boissonnat and Pritam introduced an algorithm to reduce a filtration of flag (or clique) complexes, which can in particular speed up the computation of its persistent homology. They used so-called edge collapse to reduce the input flag filtration and their reduction method required only the 1-skeleton of the filtration. In this paper we revisit the usage of edge collapse for efficient computation of persistence homology. We first give a simple and intuitive explanation of the principles underlying that algorithm. This in turn allows us to propose various extensions including a zigzag filtratio…
Mix-GENEO: A Flexible Filtration for Multiparameter Persistent Homology Detects Digital Images
School of Mathematics, Jilin University（吉林大学数学学院）；School of Artificial Intelligence, Jilin University（吉林大学人工智能学院）；School of Mathematical Science, Heilongjiang University（黑龙江大学数学科学学院）
Persistence Pairing Graphs: Tracking Changes of Selected Homology Bases
Dioscuri Centre in Topological Data Analysis, Institute of Mathematics of the Polish Academy of Sciences（波兰科学院数学研究所拓扑数据分析迪奥斯库里中心）；International Environmental Doctoral School, University of Silesia in Katowice（卡托维兹西里西亚大学国际环境博士学院）
The Vietoris-Rips filtration for an $n$-point metric space is a sequence of large simplicial complexes adding a topological structure to the otherwise disconnected space. The persistent homology is a key tool in topological data analysis and studies topological features of data that persist over many scales. The fastest algorithm for computing persistent homology of a filtration has time $O(M(u)+u^2\log^2 u)$, where $u$ is the number of updates (additions or deletions of simplices), $M(u)=O(u^{2.376})$ is the time for multiplication of $u\times u$ matrices. For a space of $n$ points given by t…
Proximity complexes and filtrations are central constructions in topological data analysis. Built using distance functions, or more generally metrics, they are often used to infer connectivity information from point clouds. Here we investigate proximity complexes and filtrations built over the Chebyshev metric, also known as the maximum metric or $\ell_{\infty}$ metric, rather than the classical Euclidean metric. Somewhat surprisingly, the $\ell_{\infty}$ case has not been investigated thoroughly. In this paper, we examine a number of classical complexes under this metric, including the Čech, …
Path homology proposed by S.-T.Yau and his co-workers provides a new mathematical model for directed graphs and networks. Persistent path homology (PPH) extends the path homology with filtration to deal with asymmetry structures. However, PPH is constrained to purely topological persistence and cannot track the homotopic shape evolution of data during filtration. To overcome the limitation of PPH, persistent path Laplacian (PPL) is introduced to capture the shape evolution of data. PPL's harmonic spectra fully recover PPH's topological persistence and its non-harmonic spectra reveal the homoto…
A challenge in computational topology is to deal with large filtered geometric complexes built from point cloud data such as Vietoris-Rips filtrations. This has led to the development of schemes for parallel computation and compression which restrict simplices to lie in open sets in a cover of the data. We extend the method of acyclic carriers to the setting of persistent homology to give detailed bounds on the relationship between Vietoris-Rips filtrations restricted to covers and the full construction. We show how these complexes can be used to study data over a base space and use our result…
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…
We introduce a theoretical and computational framework to use discrete Morse theory as an efficient preprocessing in order to compute zigzag persistent homology. From a zigzag filtration of complexes $(K_i)$, we introduce a zigzag Morse filtration whose complexes $(A_i)$ are Morse reductions of the original complexes $(K_i)$, and we prove that they both have same persistent homology. This zigzag Morse filtration generalizes the filtered Morse complex of Mischaikow and Nanda, defined for standard persistence. The maps in the zigzag Morse filtration are forward and backward inclusions, as is sta…
Given a filtration of a commutative monoid $A$ in a symmetric monoidal stable model category $\mathcal{C}$, we construct a spectral sequence analogous to the May spectral sequence whose input is the higher order topological Hochschild homology of the associated graded commutative monoid of $A$, and whose output is the higher order topological Hochschild homology of $A$. We then construct examples of such filtrations and derive some consequences: for example, given a connective commutative graded ring $R$, we get an upper bound on the size of the $THH$-groups of $E_{\infty}$-ring spectra $A$ su…
Persistent homology is a method from computational algebraic topology that can be used to study the "shape" of data. We illustrate two filtrations --- the weight rank clique filtration and the Vietoris--Rips (VR) filtration --- that are commonly used in persistent homology, and we apply these filtrations to a pair of data sets that are both related to the 2016 European Union "Brexit" referendum in the United Kingdom. These examples consider a topical situation and give useful illustrations of the strengths and weaknesses of these methods.
Given a set P of n points and a constant k, we are interested in computing the persistent homology of the Cech filtration of P for the k-distance, and investigate the effectiveness of dimensionality reduction for this problem, answering an open question of Sheehy [Proc. SoCG, 2014]. We show that any linear transformation that preserves pairwise distances up to a (1 +/- e) multiplicative factor, must preserve the persistent homology of the Cech filtration up to a factor of (1-e)^(-1). Our results also show that the Vietoris-Rips and Delaunay filtrations for the k-distance, as well as the Cech f…
University of Salzburg（萨尔茨堡大学）；ETH Zurich（苏黎世联邦理工学院）；UNC Chapel Hill（北卡罗来纳大学教堂山分校）
We propose an approach to learning with graph-structured data in the problem domain of graph classification. In particular, we present a novel type of readout operation to aggregate node features into a graph-level representation. To this end, we leverage persistent homology computed via a real-valued, learnable, filter function. We establish the theoretical foundation for differentiating through the persistent homology computation. Empirically, we show that this type of readout operation compares favorably to previous techniques, especially when the graph connectivity structure is informative…
We determine the BP-module structure, mod higher filtration, of the main part of the BP-homology of elementary abelian 2-groups. The action is related to symmetric polynomials and to Dickson invariants.
Comparison between multidimensional persistent Betti numbers is often based on the multidimensional matching distance. While this metric is rather simple to define and compute by considering a suitable family of filtering functions associated with lines having a positive slope, it has two main drawbacks. First, it forgets the natural link between the homological properties of filtrations associated with lines that are close to each other. As a consequence, part of the interesting homological information is lost. Second, its intrinsically discontinuous definition makes it difficult to study its…
We give an account of the construction of the Bhatt--Morrow--Scholze motivic filtration on topological cyclic homology and related invariants, focusing on the case of equal characteristic $p$ and the connections to crystalline and de Rham--Witt theory.
