Lower bounds on the homology of Vietoris-Rips complexes of hypercube graphs
Abstract
We provide novel lower bounds on the Betti numbers of Vietoris-Rips complexes of hypercube graphs of all dimensions, and at all scales. In more detail, let Qn be the vertex set of 2n vertices in the n-dimensional hypercube graph, equipped with the shortest path metric. Let VR(Qn;r) be its Vietoris--Rips complex at scale parameter r 0, which has Qn as its vertex set, and all subsets of diameter at most r as its simplices. For integers r<r' the inclusion VR(Qn;r) VR(Qn;r') is nullhomotopic, meaning no persistent homology bars have length longer than one, and we therefore focus attention on the individual spaces VR(Qn;r). We provide lower bounds on the ranks of homology groups of VR(Qn;r). For example, using cross-polytopal generators, we prove that the rank of H2r-1(VR(Qn;r)) is at least 2n-(r+1)nr+1. We also prove a version of homology propagation: if q 1 and if p is the smallest integer for which rank Hq(VR(Qp;r))≠ 0, then rank Hq(VR(Qn;r)) Σi=pn 2i-p i-1p-1 · rank Hq(VR(Qp;r)) for all n p. When r 3, this result and variants thereof provide tight lower bounds on the rank of Hq(VR(Qn;r)) for all n, and for each r 4 we produce novel lower bounds on the ranks of homology groups. Furthermore, we show that for each r 2, the homology groups of VR(Qn;r) for n 2r+1 contain propagated homology not induced by the initial cross-polytopal generators.
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.