arXiv Analytics

Sign in

arXiv:0910.1649 [math.PR]AbstractReferencesReviewsResources

Random geometric complexes

Matthew Kahle

Published 2009-10-09, updated 2010-12-06Version 3

We study the expected topological properties of Cech and Vietoris-Rips complexes built on i.i.d. random points in R^d. We find higher dimensional analogues of known results for connectivity and component counts for random geometric graphs. However, higher homology H_k 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. The main technical contribution of the article is in the application of discrete Morse theory in geometric probability.

Comments: 26 pages, 3 figures, final revisions, to appear in Discrete & Computational Geometry
Journal: Discrete Comput Geom (2011) 45: 553-573
Categories: math.PR, math.AT, math.CO, math.MG
Subjects: 60D05, 55U10, 05C80
Related articles: Most relevant | Search more
arXiv:1805.08669 [math.PR] (Published 2018-05-22)
Optimal Cheeger cuts and bisections of random geometric graphs
arXiv:1906.04861 [math.PR] (Published 2019-06-11)
Homological Connectivity in Čech Complexes
arXiv:2501.02676 [math.PR] (Published 2025-01-05)
On the components of random geometric graphs in the dense limit