Random Structures and Algorithms Прикладная математика

Random Triangulations of the d‐Sphere With Minimum Volume

Agelos Georgakopoulos, John Haslegrave, Joel Larsson Danielsson
Wiley · 2026-11-18 · DOI 10.1002/rsa.70090

Аннотация

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 .

Читать у издателя →