Crackle: The Homology of Noise

We study the homology of simplicial complexes built via deterministic rules from a random set of vertices. In particular, we show that, depending on the randomness that generates the vertices, the homology of these complexes can either become trivial as the number n of vertices grows, or can contain more and more complex structures. The different behaviours are consequences of different underlying distributions for the generation of vertices, and we consider three illustrative examples, when the vertices are sampled from Gaussian, exponential, and power-law distributions in R d . We also discuss consequences of our results for manifold learning with noisy data, describing the topological phenomena that arise in this scenario as “crackle”, in analogy to audio crackle in temporal signal analysis.