Thresholds for geometric graphs
Abstract
A metric probability space M admits thresholds if the random geometric graph on M has a threshold for every monotone graph property. We connect the existence of thresholds to the uniform expansion of M and prove that all standard tori, spheres, and cubes admit thresholds.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.