Maximally persistent cycles in random geometric complexes

DOI10.1214/16-AAP1232MaRDI QIDQ1676430zbMATH OpenOpenAlexFDO

Authors Omer Bobrowski, Matthew Kahle, Primoz Skraba

Publication date 7 November 2017

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.04347, https://projecteuclid.org/euclid.aoap/1504080025

zbMATH Keywords

persistent homologystochastic topologytopological inference

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Other homology theories in algebraic topology (55N35) Geometric probability and stochastic geometry (60D05) Statistics of extreme values; tail inference (62G32)

Abstract: We initiate the study of persistent homology of random geometric simplicial complexes. Our main interest is in maximally persistent cycles of degree-$k$ in persistent homology, for a either the cech or the Vietoris--Rips filtration built on a uniform Poisson process of intensity $n$ in the unit cube $[0,1{]}^d$. This is a natural way of measuring the largest "$k$-dimensional hole" in a random point set. This problem is in the intersection of geometric probability and algebraic topology, and is naturally motivated by a probabilistic view of topological inference. We show that for all $dge2$ and $1lekled-1$ the maximally persistent cycle has (multiplicative) persistence of order ${\displaystyle }$ Theta left(left(frac{log n}{log log n} ight)^{1/k} ight),${\displaystyle }$ with high probability, characterizing its rate of growth as $noinfty$. The implied constants depend on $k$, $d$, and on whether we consider the Vietoris--Rips or cech filtration.

Recommendations

• Geodesic cycles in random graphs
• Geodesics and almost geodesic cycles in random regular graphs
• Persistent graphs and cyclic polytope triangulations
• The Persistent Homology of Cyclic Graphs
• On the cycle structure of the product of random maximal cycles
• On the cycle space of a random graph
• Cycles in random graphs
• On persistent homology of random \v{C}ech complexes
• Hamilton cycles in random geometric graphs
• Random geometric complexes

Cited in

(35)

• Topology of random geometric complexes: a survey
• Limit theorems for Betti numbers of extreme sample clouds with application to persistence barcodes
• Cliques and cavities in the human connectome
• Limit theorems for random cubical homology
• Homotopy types of random cubical complexes
• A topological approach to inferring the intrinsic dimension of convex sensing data
• Extremal lifetimes of persistent cycles
• Homological connectivity in random Čech complexes
• Convergence of persistence diagrams for topological crackle
• Randomly weighted \(d\)-complexes: minimal spanning acycles and persistence diagrams
• Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport
• Probabilistic convergence and stability of random mapper graphs
• Modelling persistence diagrams with planar point processes, and revealing topology with bagplots
• On the choice of weight functions for linear representations of persistence diagrams
• Topological data analysis approaches to uncovering the timing of ring structure onset in filamentous networks
• Limit theorems for process-level Betti numbers for sparse and critical regimes
• Random Simplicial Complexes: Models and Phenomena
• The density of expected persistence diagrams and its kernel based estimation
• The multi-cover persistence of Euclidean balls
• A fractal dimension for measures via persistent homology
• Radius functions on Poisson-Delaunay mosaics and related complexes experimentally
• Certified mapper: repeated testing for acyclicity and obstructions to the nerve lemma
• Persistent homology detects curvature
• Simplicial complexes and complex systems
• Expected sizes of Poisson-Delaunay mosaics and their discrete Morse functions
• Random Čech complexes on Riemannian manifolds
• Geometric Approaches to Persistent Homology
• Random Čech complexes on manifolds with boundary
• What Are Higher-Order Networks?
• A limit theorem for persistence diagrams of random filtered complexes built over marked point processes
• Maximal persistence in random clique complexes
• Expected complexity of barcode reduction
• Probabilistic analysis of multiparameter persistence decompositions into intervals
• Geometric bounds for persistence
• Fractal dimension and the persistent homology of random geometric complexes

This page was built for publication: Maximally persistent cycles in random geometric complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676430)