Sketching Persistence Diagrams

Donald R. Sheehy, Siddharth Sheth

Given a persistence diagram with $n$ points, we give an algorithm that produces a sequence of $n$ persistence diagrams converging in bottleneck distance to the input diagram, the $…