David Aldous

From Wikipedia, the free encyclopedia
David Aldous

David Aldous in Berkeley
Born (1952-07-13) 13 July 1952
Nationality English
Fields Mathematics
Institutions University of California, Berkeley
Alma mater University of Cambridge
Doctoral advisor David J. H. Garling
Doctoral students Jose Palacios
Notable awards Loève Prize (1993)
Davidson Prize (1980)

David John Aldous, FRS (born 13 July 1952) is a mathematician known for his research on mathematical 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] Since 1979 Aldous has been on the faculty at University of California, Berkeley.

He was awarded the Rollo Davidson Prize in 1980, the Loève Prize in 1993, and was elected a Fellow of the Royal Society in 1994. In 2004, Aldous was elected a Fellow of the American Academy of Arts and Sciences.[2] In 2012 he became a fellow of the American Mathematical Society.[3]

Selected publications

Books

  • Aldous, David (1989). Probability approximations via the Poisson clumping heuristic. Applied Mathematical Sciences 77. New York: Springer-Verlag. pp. xvi+269. ISBN 0-387-96899-7. MR 969362. 

Papers

  • Aldous, David, "Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists". Bernoulli 5 (1999) pp. 348.
  • Aldous, David, "Exchangeability and related topics". Lecture Notes in Math., 1117 (1985) pp 1198. Springer, Berlin.

References

  1. David Aldous at the Mathematics Genealogy Project
  2. "Book of Members, 1780-2010: Chapter A". American Academy of Arts and Sciences. Retrieved 14 April 2011. 
  3. List of Fellows of the American Mathematical Society, retrieved 3 November 2012.

External links

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.