A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
The threshold for stacked triangulations
[article]
2022
arXiv
pre-print
A stacked triangulation of a d-simplex 𝐨={1,...,d+1} (d≥ 2) is a triangulation obtained by repeatedly subdividing a d-simplex into d+1 new ones via a new vertex (the case d=2 is known as an Appolonian network). We study the occurrence of such a triangulation in the Linial–Meshulam model, i.e., for which p does the random simplicial complex Y∼𝒴_d(n,p) contain the faces of a stacked triangulation of the d-simplex 𝐨, with its internal vertices labeled in [n]. In the language of bootstrap
arXiv:2112.12780v2
fatcat:ybnc74komfhppbahz42sftrrnm