# IDEAS Seminar- David Aldous (UC Berkeley)

## 4 Oct @ 3:30 pm - 4:30 pm

# IDEAS Seminar- David Aldous (UC Berkeley)

**4 Oct @ 3:30 pm – 4:30 pm**

**David Aldous is Professor Emeritus in the Statistics Dept at U.C. Berkeley. He is the author of “Probability Approximations via the Poisson Clumping Heuristic” and (with Jim Fill) of a notorious unfinished online work “Reversible Markov Chains and Random Walks on Graphs”. His research in mathematical probability has covered weak convergence, exchangeability, Markov chain mixing times, continuum random trees, stochastic coalescence and spatial random networks. A central theme has been the study of large finite random structures, obtaining asymptotic behavior as the size tends to infinity via consideration of some suitable infinite random structure. In later years he became interested in articulating critically what mathematical probability says about the real world. He is a Fellow of the Royal Society, and a foreign associate of the National Academy of Sciences.**

__Short Biography:__

__Some Topics in Spatial Networks__**David Aldous**

**U.C. Berkeley and University of Washington**

__Abstract:__*There is a huge 21st century literature on quantitative aspects of networks.*

*One aspect is spatial networks, that is networks embedded in the plane, exemplified by road networks.*

*The recent book “Spatial Networks: A complete introduction” by Marc Barthélemy*

*provides an overview of the field from the viewpoint of statistical physics, that is to say using probability models.*

*Although various specific topics within this field have been studied in depth by mathematicians, many others have not.*

*The talk will illustrate a range of rather neglected topics, loosely related to accessible data, that seem interesting for potential theoretical research.*