“…We will refer to these generalizations as random combinatorial complexes (see [26] for a survey). It turns out that the Erdős -Rényi threshold for connectivity can be generalized to that of "homological connectivity," where the higher homology groups H k become trivial.In parallel to the study of combinatorial complexes, a line of research was established for random geometric complexes [3,5,24,42,43]. This type of complexes generalizes the model of the random geometric graph G(n, r) (introduced by Gilbert [18]), where vertices are placed at random in a metric-measure space, and edges are included based on proximity [38].…”