Categorification of persistent homology

We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving distance, which we show generalizes the previously-studied bottleneck distance. To illustrate the utility of this approach, we greatly generalize previous stability results for persistence, extended persistence, and kernel, image and cokernel persistence. We give a natural construction of a category of interleavings of these diagrams, and show that if the target category is abelian, so is this category of interleavings.Comment: 27 pages, v3: minor changes, to appear in Discrete & Computational Geometr

Comparing persistence diagrams through complex vectors

The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from combinatorial explosion. A possible algebraic representation of persistence diagrams is offered by complex polynomials; since far polynomials represent far persistence diagrams, a fast comparison of the coefficient vectors can reduce the size of the database to be classified by the bottleneck distance. This article explores experimentally three transformations from diagrams to polynomials and three distances between the complex vectors of coefficients.Comment: 11 pages, 4 figures, 2 table

Dualities in persistent (co)homology

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.Comment: 16 pages, 3 figures, submitted to the Inverse Problems special issue on Topological Data Analysi

The Theory of the Interleaving Distance on Multidimensional Persistence Modules

In 2009, Chazal et al. introduced $\epsilon$-interleavings of persistence modules. $\epsilon$-interleavings induce a pseudometric $d_I$ on (isomorphism classes of) persistence modules, the interleaving distance. The definitions of $\epsilon$-interleavings and $d_I$ generalize readily to multidimensional persistence modules. In this paper, we develop the theory of multidimensional interleavings, with a view towards applications to topological data analysis. We present four main results. First, we show that on 1-D persistence modules, $d_I$ is equal to the bottleneck distance $d_B$. This result, which first appeared in an earlier preprint of this paper, has since appeared in several other places, and is now known as the isometry theorem. Second, we present a characterization of the $\epsilon$-interleaving relation on multidimensional persistence modules. This expresses transparently the sense in which two $\epsilon$-interleaved modules are algebraically similar. Third, using this characterization, we show that when we define our persistence modules over a prime field, $d_I$ satisfies a universality property. This universality result is the central result of the paper. It says that $d_I$ satisfies a stability property generalizing one which $d_B$ is known to satisfy, and that in addition, if $d$ is any other pseudometric on multidimensional persistence modules satisfying the same stability property, then $d\leq d_I$. We also show that a variant of this universality result holds for $d_B$, over arbitrary fields. Finally, we show that $d_I$ restricts to a metric on isomorphism classes of finitely presented multidimensional persistence modules.Comment: Major revision; exposition improved throughout. To appear in Foundations of Computational Mathematics. 36 page

Gait-based gender classification using persistent homology

In this paper, a topological approach for gait-based gender recognition is presented. First, a stack of human silhouettes, extracted by background subtraction and thresholding, were glued through their gravity centers, forming a 3D digital image I. Second, different filters (i.e. particular orders of the simplices) are applied on ∂ K(I) (a simplicial complex obtained from I) which capture relations among the parts of the human body when walking. Finally, a topological signature is extracted from the persistence diagram according to each filter. The measure cosine is used to give a similarity value between topological signatures. The novelty of the paper is a notion of robustness of the provided method (which is also valid for gait recognition). Three experiments are performed using all human-camera view angles provided in CASIA-B database. The first one evaluates the named topological signature obtaining 98.3% (lateral view) of correct classification rates, for gender identification. The second one shows results for different human-camera distances according to training and test (i.e. training with a human-camera distance and test with a different one). The third one shows that upper body is more discriminative than lower body

Optimal topological simplification of discrete functions on surfaces

We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance {\delta} from a given input function. The result is achieved by establishing a connection between discrete Morse theory and persistent homology. Our method completely removes homological noise with persistence less than 2{\delta}, constructively proving the tightness of a lower bound on the number of critical points given by the stability theorem of persistent homology in dimension two for any input function. We also show that an optimal solution can be computed in linear time after persistence pairs have been computed.Comment: 27 pages, 8 figure

Topological characteristics of oil and gas reservoirs and their applications

We demonstrate applications of topological characteristics of oil and gas reservoirs considered as three-dimensional bodies to geological modeling.Comment: 12 page

Absence of lattice strain anomalies at the electronic topological transition in zinc at high pressure

High pressure structural distortions of the hexagonal close packed (hcp) element zinc have been a subject of controversy. Earlier experimental results and theory showed a large anomaly in lattice strain with compression in zinc at about 10 GPa which was explained theoretically by a change in Fermi surface topology. Later hydrostatic experiments showed no such anomaly, resulting in a discrepancy between theory and experiment. We have computed the compression and lattice strain of hcp zinc over a wide range of compressions using the linearized augmented plane wave (LAPW) method paying special attention to k-point convergence. We find that the behavior of the lattice strain is strongly dependent on k-point sampling, and with large k-point sets the previously computed anomaly in lattice parameters under compression disappears, in agreement with recent experiments.Comment: 9 pages, 6 figures, Phys. Rev. B (in press

Random geometric complexes

We study the expected topological properties of Cech and Vietoris-Rips complexes built on i.i.d. random points in R^d. We find higher dimensional analogues of known results for connectivity and component counts for random geometric graphs. However, higher homology H_k is not monotone when k > 0. In particular for every k > 0 we exhibit two thresholds, one where homology passes from vanishing to nonvanishing, and another where it passes back to vanishing. We give asymptotic formulas for the expectation of the Betti numbers in the sparser regimes, and bounds in the denser regimes. The main technical contribution of the article is in the application of discrete Morse theory in geometric probability.Comment: 26 pages, 3 figures, final revisions, to appear in Discrete & Computational Geometr

The K^*_0(800) scalar resonance from Roy-Steiner representations of pi K scattering

We discuss the existence of the light scalar meson K^*_0(800) (also called kappa) in a rigorous way, by showing the presence of a pole in the pi K --> pi K amplitude on the second Riemann sheet. For this purpose, we study the domain of validity of two classes of Roy-Steiner representations in the complex energy plane. We prove that one of them is valid in a region sufficiently broad in the imaginary direction. From this representation, we compute the l=0 partial wave in the complex plane with neither additional approximation nor model dependence, relying only on experimental data. A scalar resonance with strangeness S=1 is found with the following mass and width: E_kappa = 658 \pm 13 MeV and Gamma_kappa = 557 \pm 24 MeV.Comment: 16 pages, 8 figures. Domain of validity of a Roy-Steiner representation corrected and enlarged, and features of the K^*_0(800) pole discussed in more details. Conclusions unchange