Papers
Topics
Authors
Recent
Search
2000 character limit reached

On simple connectivity of random 2-complexes

Published 8 Jun 2018 in math.CO, math.GT, and math.PR | (1806.03351v1)

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 = 44/33$, 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.