Random Triangulations of the d‐Sphere With Minimum Volume
We study a higher‐dimensional analogue of the random traveling salesman problem: Let the complete ‐dimensional simplicial complex on vertices be equipped with i.i.d. volumes on its facets, uniformly random in . What is the minimum volume of a sub‐complex homeomorphic to the ‐dimensional sphere , containing all vertices? We determine the growth rate of , and prove that it is well‐concentrated. For we prove such results to the extent that current knowledge about the number of triangulations of allows. We remark that this can be thought of as a model of random geometry in the spirit of Angel & Schramm's UIPT, and provide a generalised framework that interpolates between our model and the uniform random triangulation of .
Authors
- John Haslegrave (ORCID: https://orcid.org/0000-0002-9991-7120)
- Agelos Georgakopoulos (ORCID: https://orcid.org/0000-0001-6430-567X)
- Joel Larsson Danielsson (ORCID: https://orcid.org/0000-0003-1080-3440)
Institutions
- Lund University (SE)
- University of Warwick (GB)
- Lancaster University (GB)
Publication Details
- Journal
- Random Structures and Algorithms
- Published
- 2026-11-18
- DOI
- https://doi.org/10.1002/rsa.70090
- Primary Topic
- Point processes and geometric inequalities
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- European Commission
- Engineering and Physical Sciences Research Council
- European Research Council