Discrete & Computational Geometry

, Volume 45, Issue 3, pp 553–573

Random Geometric Complexes

Authors

    • School of MathematicsInstitute for Advanced Study
Article

DOI: 10.1007/s00454-010-9319-3

Cite this article as:
Kahle, M. Discrete Comput Geom (2011) 45: 553. doi:10.1007/s00454-010-9319-3

Abstract

We study the expected topological properties of Čech and Vietoris–Rips complexes built on random points in ℝd. We find higher-dimensional analogues of known results for connectivity and component counts for random geometric graphs. However, higher homology Hk is not monotone when k>0.

In particular, for every k>0, we exhibit two thresholds, one where homology passes from vanishing to nonvanishing, and another where it passes back to vanishing. We give asymptotic formulas for the expectation of the Betti numbers in the sparser regimes, and bounds in the denser regimes.

Keywords

Random geometric graphsProbabilistic topologyTopological data analysis

Copyright information

© Springer Science+Business Media, LLC 2011