Persistent Betti numbers of random Čech complexes

01/25/2018
by   Ulrich Bauer, et al.
0

We study the persistent homology of random Č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 Č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.

READ FULL TEXT
research
03/08/2019

On the asymptotic normality of persistent Betti numbers

Persistent Betti numbers are a major tool in persistent homology, a subf...
research
08/07/2018

The Persistent Homology of Random Geometric Complexes on Fractals

We study the asymptotic behavior of the persistent homology of i.i.d. sa...
research
12/17/2020

On the persistent homology of almost surely C^0 stochastic processes

The persistent homology of random processes has been a question of inter...
research
02/07/2023

A generalization of the persistent Laplacian to simplicial maps

The graph Laplacian is a fundamental object in the analysis of and optim...
research
05/10/2019

On limit theorems for persistent Betti numbers from dependent data

We study persistent Betti numbers and persistence diagrams obtained from...
research
11/12/2019

Terrain Visibility Graphs and Cyclic Polytope Triangulations

We prove a bijection between the triangulations of the 3-dimensional cyc...
research
02/20/2023

Computing persistent homology by spanning trees and critical simplices

Topological data analysis can extract effective information from higher-...

Please sign up or login with your details

Forgot password? Click here to reset