Hyperbolic random geometric graphs
Random geometric graphs are constructed by sampling n points at random
from some probability distribution on the plane and connecting two points
when the distance is less than some parameter r.
I this talk I will discuss some preliminary results on what happens when
the points of the random geometric graph live in the hyperbolic plane rather than the ordinary, euclidean plane.
Perhaps rather surprising, this variation on the model leads to very different
behaviour from the standard, euclidean version.
(Based on ongoing joint works with Bode, Broman, Fountoulakis and Tykesson)