The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



Discrete and Continuum Random Spatial Networks

Aldous, D (Berkeley)
Wednesday 07 April 2010, 09:30-10:30

Seminar Room 1, Newton Institute


I will give an overview of ongoing research concerning networks in two-dimensional space, emphasizing two aspects. (1) There is a general class of "proximity graphs", defined for arbitrary vertices, which are always connected. Applying to random points gives a class of random networks which are connected and have bounded mean degree. This class has scarcely been studied, but seems an appealing modeling alternative to the classical geometric random graphs for which one cannot have both connectivity and bounded mean degree. (2) The models above envisage e.g. inter-city road networks linking distinct cities. To instead abstract online maps, suppose that for each pair of points in the plane (addresses) there is a route between them. Does it make sense to think of such a network as a realization from a probability distribution invariant under Euclidean translation and scaling?


[pdf ]


The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧