Distance Functions, Critical Points, and the Topology of Random Cech Complexes

Abstract

For a finite set of points P in Rd, the function dP: Rd R+ measures Euclidean distance to the set P. We study the number of critical points of dP when P is a Poisson process. In particular, we study the limit behavior of Nk - the number of critical points of dP with Morse index k - as the density of points grows. We present explicit computations for the normalized, limiting, expectations and variances of the Nk, as well as distributional limit theorems. We link these results to recent results in which the Betti numbers of the random Cech complex based on P were studied.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…