English

On the phase transition in random simplicial complexes

Probability 2016-09-20 v2 Combinatorics

Abstract

It is well-known that the G(n,p)G(n,p) model of random graphs undergoes a dramatic change around p=1np=\frac 1n. It is here that the random graph is, almost surely, no longer a forest, and here it first acquires a giant (i.e., order Ω(n)\Omega(n)) connected component. Several years ago, Linial and Meshulam have introduced the Xd(n,p)X_d(n,p) model, a probability space of nn-vertex dd-dimensional simplicial complexes, where X1(n,p)X_1(n,p) coincides with G(n,p)G(n,p). Within this model we prove a natural dd-dimensional analog of these graph theoretic phenomena. Specifically, we determine the exact threshold for the nonvanishing of the real dd-th homology of complexes from Xd(n,p)X_d(n,p). We also compute the real Betti numbers of Xd(n,p)X_d(n,p) for p=c/np=c/n. Finally, we establish the emergence of giant shadow at this threshold. (For d=1d=1 a giant shadow and a giant component are equivalent). Unlike the case for graphs, for d2d\ge 2 the emergence of the giant shadow is a first order phase transition.

Keywords

Cite

@article{arxiv.1410.1281,
  title  = {On the phase transition in random simplicial complexes},
  author = {Nathan Linial and Yuval Peled},
  journal= {arXiv preprint arXiv:1410.1281},
  year   = {2016}
}
R2 v1 2026-06-22T06:13:44.149Z