Graded Persistence Diagrams and Persistence Landscapes

Abstract

We introduce a refinement of the persistence diagram, the graded persistence diagram. It is the Möbius inversion of the graded rank function, which is obtained from the rank function using the unary numeral system. Both persistence diagrams and graded persistence diagrams are integer-valued functions on the Cartesian plane. Whereas the persistence diagram takes non-negative values, the graded persistence diagram takes values of 0, 1, or $$-1$$ . The sum of the graded persistence diagrams is the persistence diagram. We show that the positive and negative points in the kth graded persistence diagram correspond to the local maxima and minima, respectively, of the kth persistence landscape. We prove a stability theorem for graded persistence diagrams: the 1-Wasserstein distance between kth graded persistence diagrams is bounded by twice the 1-Wasserstein distance between the corresponding persistence diagrams, and this bound is attained. In the other direction, the 1-Wasserstein distance is a lower bound for the sum of the 1-Wasserstein distances between the kth graded persistence diagrams. In fact, the 1-Wasserstein distance for graded persistence diagrams is more discriminative than the 1-Wasserstein distance for the corresponding persistence diagrams.