David Aldous | |
---|---|
Born | 13 July 1952 |
Nationality | British, American |
Alma mater | University of Cambridge |
Awards | Loève Prize (1993) Rollo Davidson Prize (1980) |
Scientific career | |
Fields | Mathematics |
Institutions | University of California, Berkeley |
Doctoral advisor | David J. H. Garling |
David John Aldous FRS (born 13 July 1952) is a mathematician known for his research on probability theory and its applications, in particular in topics such as exchangeability, weak convergence, Markov chain mixing times, the continuum random tree and stochastic coalescence. He entered St. John's College, Cambridge, in 1970 and received his Ph.D. at the University of Cambridge in 1977 under his advisor, D. J. H. Garling.[1] Aldous was on the faculty at University of California, Berkeley from 1979 until his retirement in 2018.[2][3]
He was awarded the Rollo Davidson Prize in 1980, the Loève Prize in 1993,[4] and was elected a Fellow of the Royal Society in 1994.[5] In 2004, Aldous was elected a Fellow of the American Academy of Arts and Sciences.[6] From 2004 to 2010, Aldous was an Andrew Dickson White Professor-at-Large at Cornell University.[7] He was an invited speaker at the International Congress of Mathematicians (ICM) in 1998 in Berlin[8] and a plenary speaker at the ICM in 2010 in Hyderabad.[9] In 2012 he became a fellow of the American Mathematical Society.[10] He discovered (independently from Andrei Broder) an algorithm for generating a uniform spanning tree of a given graph.