Papers
Topics
Authors
Recent
Search
2000 character limit reached

Strong topology on the set of persistence diagrams

Published 21 May 2020 in math.GN and math.MG | (2005.10773v1)

Abstract: We endow the set of persistence diagrams with the strong topology (the topology of countable direct limit of increasing sequence of bounded subsets considered in the bottleneck distance). The topology of the obtained space is described. Also, we prove that the space of persistence diagrams with the bottleneck metric has infinite asymptotic dimension in the sense of Gromov.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.