Abstract: Geometric random graphs are graphs on a dense subset of a metric space, chosen at random, such that two vertices are connected if the distance between them is < delta (for some constant delta) with probability p. I will discuss some results concerning their model theory.
This is joint work with Omer Ben-Neria and Tingxiang Zou.