Random Triangulations of the d‐Sphere With Minimum Volume
Random Structures & Algorithms · 2026-12 · 69 (4)
DOI: 10.1002/rsa.70090 ↗Kurz gefasst
Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 18.11.2026. Verfasst von Agelos Georgakopoulos und 2 weiteren Autor:innen. Die Arbeit nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: European Research Council, Engineering and Physical Sciences Research Council.
Abstract (Originalsprache)
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 .
Förderung
- European Research Council
- Engineering and Physical Sciences Research Council
Zitieren
APA
Georgakopoulos, A., Haslegrave, J., & Danielsson, J. L. (2026). Random Triangulations of the d‐Sphere With Minimum Volume. Random Structures & Algorithms, 69(4). https://doi.org/10.1002/rsa.70090
Vancouver
Georgakopoulos A, Haslegrave J, Danielsson JL. Random Triangulations of the d‐Sphere With Minimum Volume. Random Structures & Algorithms. 2026;69(4). doi:10.1002/rsa.70090
BibTeX
@article{Georgakopoulos2026,
author = {Georgakopoulos, Agelos and Haslegrave, John and Danielsson, Joel Larsson},
title = {Random Triangulations of the d‐Sphere With Minimum Volume},
journal = {Random Structures & Algorithms},
year = {2026},
volume = {69},
number = {4},
doi = {10.1002/rsa.70090}
}
EUVIMED