Abstract: As one of the simplest random graph models with spatial content, random geometric graphs are of importance in network modeling. They are defined by placing n vertices randomly in d-space and joining close points by edges. The geometric element distinguishes these graphs from the classical random graph models of Erdos and Renyi. We discuss some of the large-n asymptotic theory of these graphs, concerned with such issues as connectivity, critical phenomena, and the giant component.
Here is a link to the slides of Penrose’s talk
Location: room 611 of the Wiskunde building (campus De Uithof) Budapestlaan 6, Utrecht.
Date and time: Thursday, November 12, 2009 15:30-16:30. The lecture is preceded by coffee, tea, and cookies from 15.00 to 15.30 hour in the same room.
Schedule of the Utrecht math colloquium : Next term’s talks, This year's talks. Last year's talks. Guidelines for speakers.
Other math colloquia : TU Delft, Leiden, UvA Amsterdam, VU Amsterdam, Nijmegen.
Organisers : Gil Cavalcanti, Wilberd van der Kallen and Paul Zegeling