The rank invariant stability via interleavings (Q1713414)

The author focuses on the problem of comparing persistence by using the interleaving distance which measures the amount of shift necessary to map two persistence modules into each other. The paper deals with the rank invariant which captures the rank values of the linear maps defining the persistence module. The first contribution of the paper is to give a new proof of the rank invariant stability, that is the property of undergoing small changes when the input data is slightly perturbed. The main contribution of the paper is to prove the internal stability of the rank invariant: a key property for the multidimensional matching distance computation, that is the property of undergoing small changes when parameters are slightly perturbed. For the entire collection see [Zbl 1401.55001].