English

On simple connectivity of random 2-complexes

Combinatorics 2018-06-12 v1 Geometric Topology Probability

Abstract

The fundamental group of the 22-dimensional Linial-Meshulam random simplicial complex Y2(n,p)Y_2(n,p) was first studied by Babson, Hoffman and Kahle. They proved that the threshold probability for simple connectivity of Y2(n,p)Y_2(n,p) is about pn1/2p\approx n^{-1/2}. In this paper, we show that this threshold probability is at most p(γn)1/2p\le (\gamma n)^{-1/2}, where γ=44/33\gamma = 4^4/3^3, and conjecture that this threshold is sharp. In fact, we show that p=(γn)1/2p=(\gamma n)^{-1/2} is a sharp threshold probability for the stronger property that every cycle of length 33 is the boundary of a subcomplex of Y2(n,p)Y_2(n,p) 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}
}
R2 v1 2026-06-23T02:24:10.618Z