Papers
Topics
Authors
Recent
Search
2000 character limit reached

Persistent Betti numbers of random Čech complexes

Published 25 Jan 2018 in math.AT, cs.CG, and math.MG | (1801.08376v1)

Abstract: We study the persistent homology of random \v{C}ech complexes. Generalizing a method of Penrose for studying random geometric graphs, we first describe an appropriate theoretical framework in which we can state and address our main questions. Then we define the kth persistent Betti number of a random \v{C}ech complex and determine its asymptotic order in the subcritical regime. This extends a result of Kahle on the asymptotic order of the ordinary kth Betti number of such complexes to the persistent setting.

Citations (6)

Summary

Paper to Video (Beta)

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.