Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Convergence of Persistence Diagrams for Topological Crackle (1810.01602v1)

Published 3 Oct 2018 in math.PR

Abstract: In this paper we study the persistent homology associated with topological crackle generated by distributions with an unbounded support. Persistent homology is a topological and algebraic structure that tracks the creation and destruction of homological cycles (generalizations of loops or holes) in different dimensions. Topological crackle is a term that refers to homological cycles generated by "noisy" samples where the support is unbounded. We aim to establish weak convergence results for persistence diagrams - a point process representation for persistent homology, where each homological cycle is represented by its (birth,death) coordinates. In this work we treat persistence diagrams as random closed sets, so that the resulting weak convergence is defined in terms of the Fell topology. In this framework we show that the limiting persistence diagrams can be divided into two parts. The first part is a deterministic limit containing a densely-growing number of persistence pairs with a short lifespan. The second part is a two-dimensional Poisson process, representing persistence pairs with a longer lifespan.

Summary

We haven't generated a summary for this paper yet.