On simple connectivity of random 2-complexes
Combinatorics
2018-06-12 v1 Geometric Topology
Probability
Abstract
The fundamental group of the -dimensional Linial-Meshulam random simplicial complex was first studied by Babson, Hoffman and Kahle. They proved that the threshold probability for simple connectivity of is about . In this paper, we show that this threshold probability is at most , where , and conjecture that this threshold is sharp. In fact, we show that is a sharp threshold probability for the stronger property that every cycle of length is the boundary of a subcomplex of that is homeomorphic to a disk. Our proof uses the Poisson paradigm, and relies on a classical result of Tutte on the enumeration of planar triangulations.
Cite
@article{arxiv.1806.03351,
title = {On simple connectivity of random 2-complexes},
author = {Zur Luria and Yuval Peled},
journal= {arXiv preprint arXiv:1806.03351},
year = {2018}
}