Feb. 17, 3:30pm, Wean 8220

Tobias Mueller, CWI Amsterdam

Random geometric graphs

Tobias Mueller, CWI Amsterdam

Random geometric graphs

Abstract:

If we pick n points at random from d-dimensional space
(i.i.d. according to some probability measure) and fix an r > 0,
then we obtain a random geometric graph by joining
two points by an edge whenever their distance is at most r.

I will give a brief overview of some of the main results on random geometric graphs and then describe my own work on Hamilton cycles and the chromatic number of random geometric graphs.