Talk information

Date: Sunday, January 25, 2026
Time: 10:10–11:00
Place: Schreiber 309
Speaker: Sahar Diskin (ETH)
Title: Universality of spanning trees in random geometric graphs

Abstract:

The $d$-dimensional random geometric graph $G_d(n,r)$ is obtained by embedding n points in $[0,1]^d$ uniformly at random and independently, and forming an edge between every two points at Euclidean distance at most $r$. We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. In particular, this provides a geometric counterpart of Montgomery’s threshold result for binomial random graphs.

Joint work with M. Anastos, D. Ignasiak, L. Lichev, and Y. Sha.