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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Random Triangulations of the d‐Sphere With Minimum Volume

John Haslegrave, Agelos Georgakopoulos, Joel Larsson Danielsson
1 links
Random Structures and Algorithms
Point processes and geometric inequalities
article

Random Triangulations of the d‐Sphere With Minimum Volume

John Haslegrave, Agelos Georgakopoulos, Joel Larsson Danielsson
article en

Abstract

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 .

Random Structures and AlgorithmsVol. 69(4)
Lund University (SE), University of Warwick (GB), Lancaster University (GB)
European Commission, Engineering and Physical Sciences Research Council, European Research Council
Point processes and geometric inequalities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon