pith. sign in

arxiv: 1806.03351 · v1 · pith:NHPYXJP3new · submitted 2018-06-08 · 🧮 math.CO · math.GT· math.PR

On simple connectivity of random 2-complexes

classification 🧮 math.CO math.GTmath.PR
keywords thresholdgammaprobabilityconnectivityrandomsharpsimpleapprox
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.