When does the top homology of a random simplicial complex vanish?
Lior Aronshtam, Nathan Linial · Random Structures and Algorithms · 2013
Abstract Several years ago Linial and Meshulam (Combinatorica 26 (2006) 457–487) introduced a model called of random n‐vertex d‐dimensional simplicial complexes. The following question suggests itself very naturally: What is the threshold probability at which the d‐dimensional homology of such a random d‐complex is, almost surely, nonzero? Here we derive an upper bound on this threshold. Computer experiments that we have conducted suggest that this bound may coincide with the actual threshold, but this remains an open question. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 26–35, 2015