Tropical Coordinates on the Space of Persistence Barcodes

  title={Tropical Coordinates on the Space of Persistence Barcodes},
  author={Sara Kali{\vs}nik Verov{\vs}ek},
  journal={arXiv: Algebraic Topology},
The aim of applied topology is to use and develop topological methods for applied mathematics, science and engineering. One of the main tools is persistent homology, an adaptation of classical homology, which assigns a barcode, i.e. a collection of intervals, to a finite metric space. Because of the nature of the invariant, barcodes are not well-adapted for use by practitioners in machine learning tasks. We can circumvent this problem by assigning numerical quantities to barcodes and these… Expand

Figures and Tables from this paper

A Framework for Differential Calculus on Persistence Barcodes
Inspired by the theory of diffeological spaces, the proposed framework uses lifts to the space of ordered barcodes to produce a chain rule that enables the use of gradient descent for objective functions factoring through thespace of barcodes. Expand
Tropical Sufficient Statistics for Persistent Homology
The sufficiency result presented in this work allows for classical probability distributions to be assumed on the tropical geometric representation of barcodes and makes a variety of parametric statistical inference methods amenable to barcodes, all while maintaining their initial interpretations. Expand
Stable Topological Summaries for Analyzing the Organization of Cells in a Packed Tissue
This study provides new insights to this problem, such as a possible novel indicator for the development of the drosophila wing disc tissue or the importance of centroids distribution to differentiate some tissues from their CVT-path counterpart (a mathematical model of epithelia based on Voronoi diagrams). Expand
Evolutionary homology on coupled dynamical systems with applications to protein flexibility analysis
Numerical results for the B-factor prediction of a benchmark set of 364 proteins indicate that the proposed evolutionary homology (EH) outperforms all the other state-of-the-art methods in the field. Expand
Topological methods for data modelling
This Review sketches the basics of TDA, which models data by graphs or networks rather than by linear algebraic methods or cluster analysis, and provides examples where this kind of analysis has been carried out. Expand
Persistent Homology of Complex Networks for Dynamic State Detection
It is shown how persistent homology, a tool from TDA, can be used to yield a compressed, multi-scale representation of the graph that can distinguish between dynamic states such as periodic and chaotic behavior. Expand
Persistent homology and applied homotopy theory
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 persistenceExpand
Geometric Metrics for Topological Representations
This chapter presents an overview of recent techniques from the emerging area ofTopological data analysis (TDA), with a focus on machine-learning applications, and presents a survey of topological representations and metrics on those representations, discuss their relative pros and cons, and illustrate their impact on a few application areas of recent interest. Expand
The Persistence Landscape and Some of Its Properties
Persistence landscapes map persistence diagrams into a function space, which may often be taken to be a Banach space or even a Hilbert space. In the latter case, it is a feature map and there is anExpand
Persistent Homology Machine Learning for Fingerprint Classification
It is shown that, to the contrary, near state-of-the-art classification accuracy rates can be achieved when applying topological data analysis (TDA) to 3-dimensional point clouds of oriented minutiae points. Expand


Persistence Images: An Alternative Persistent Homology Representation
It is shown that several machine learning techniques, applied to persistence images for classification tasks, yield high accuracy rates on multiple data sets and these sameMachine learning techniques fare better when applied to persistency images than when applied when it comes to persistence diagrams. Expand
Topological pattern recognition for point cloud data*
The definition and computation of homology in the standard setting of simplicial complexes and topological spaces are discussed, then it is shown how one can obtain useful signatures, called barcodes, from finite metric spaces, thought of as sampled from a continuous object. Expand
Statistical topological data analysis using persistence landscapes
  • Peter Bubenik
  • Mathematics, Computer Science
  • J. Mach. Learn. Res.
  • 2015
A new topological summary for data that is easy to combine with tools from statistics and machine learning and obeys a strong law of large numbers and a central limit theorem is defined. Expand
Comparing Persistence Diagrams Through Complex Vectors
This article explores experimentally three transformations from diagrams to polynomials and three distances between the complex vectors of coefficients. Expand
Computing Persistent Homology
Abstract We show that the persistent homology of a filtered d-dimensional simplicial complex is simply the standard homology of a particular graded module over a polynomial ring. Our analysisExpand
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the persistence diagramExpand
Topological persistence and simplification
A notion of topological simplification is formalized within the framework of a filtration, which is the history of a growing complex, and a topological change that happens during growth is classified as either a feature or noise, depending on its life-time or persistence within the filTration. Expand
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
Tools from computational homology are introduced to verify coverage in an idealized sensor network, which are coordinate-free and assume no localization or orientation capabilities for the nodes, there are also no probabilistic assumptions. Expand
Computing persistent homology
The homology of a filtered d-dimensional simplicial complex K is studied as a single algebraic entity and a correspondence is established that provides a simple description over fields that enables a natural algorithm for computing persistent homology over an arbitrary field in any dimension. Expand
Topological Methods for the Analysis of High Dimensional Data Sets and 3D Object Recognition
The method, called Mapper, is based on the idea of partial clustering of the data guided by a set of functions defined on the data, and is not dependent on any particular clustering algorithm, i.e. any clustering algorithms may be used with Mapper. Expand