Homological connectivity of random k-dimensional complexes
R. Meshulam, N. Wallach
Abstract
Let Deltan-1 denote the (n-1)-dimensional simplex. Let Y be a random k-dimensional subcomplex of Deltan-1 obtained by starting with the full (k-1)-dimensional skeleton of Deltan-1 and then adding each k-simplex independently with probability p. Let Hk-1(Y;R) denote the (k-1)-dimensional reduced homology group of Y with coefficients in a finite abelian group R. Let R and k ≥ 1 be fixed. It is shown that p=(k n)/n is a sharp threshold for the vanishing of Hk-1(Y;R).
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell