2013 - Fellow of the American Mathematical Society
2010 - Member of the National Academy of Sciences
2004 - Fellow of the American Academy of Arts and Sciences
1994 - Fellow of the Royal Society, United Kingdom
1993 - Wald Memorial Lecturer
David Aldous focuses on Combinatorics, Discrete mathematics, Random graph, Markov chain and Random walk. His Combinatorics study combines topics in areas such as Longest increasing subsequence and Brownian motion. His studies in Discrete mathematics integrate themes in fields like Random matrix and Random variable.
His work on Loop-erased random walk as part of general Random graph study is frequently connected to Context, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. He has researched Markov chain in several fields, including Statistical physics, Scatter plot and Exponential function. His work is dedicated to discovering how Random walk, Markov chain mixing time are connected with Markov renewal process and other disciplines.
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Markov chain, Random graph and Random walk. His Combinatorics study incorporates themes from Upper and lower bounds, Random variable, Poisson distribution, Exponential function and Plane. David Aldous studied Discrete mathematics and Scaling that intersect with Mean field theory.
In his research on the topic of Markov chain, Stochastic modelling and Brownian motion is strongly related with Statistical physics. His Random graph research focuses on Random element and how it relates to Multivariate random variable. His Random walk research is multidisciplinary, relying on both Trace, Unimodular matrix and Weak convergence.
His main research concerns Combinatorics, Discrete mathematics, Mathematical economics, Markov chain and Random graph. Particularly relevant to First passage percolation is his body of work in Combinatorics. His work carried out in the field of Discrete mathematics brings together such families of science as Poisson distribution, Random walk, Percolation and Scaling.
His Random walk research is multidisciplinary, incorporating elements of Markov renewal process, Minor, Examples of Markov chains, Pure mathematics and Markov chain mixing time. David Aldous interconnects Stochastic process, Mixing, Monotonic function and Brownian motion in the investigation of issues within Markov chain. His Random graph research incorporates themes from Entropy and Random regular graph.
His primary areas of investigation include Discrete mathematics, Combinatorics, Scaling, Interacting particle system and Mathematical economics. His research integrates issues of Markov renewal process, Examples of Markov chains, Axiom, Markov chain mixing time and Random walk in his study of Discrete mathematics. The concepts of his Combinatorics study are interwoven with issues in M/G/1 queue, Heavy traffic approximation and Scaling limit.
His Scaling research integrates issues from Poisson distribution, Invariant, Scale invariance, Euclidean geometry and Mathematical model. His study on Interacting particle system also encompasses disciplines like
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Exchangeability and related topics
David J. Aldous.
Lecture Notes in Mathematics (1985)
Reversible Markov Chains and Random Walks on Graphs
David Aldous;James Allen Fill.
(2014)
The Continuum Random Tree III
David Aldous.
Annals of Probability (1991)
The Central Limit Theorem for Real and Banach Valued Random Variables
David Aldous.
Technometrics (1981)
Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists
David J. Aldous.
Bernoulli (1999)
Probability Approximations via the Poisson Clumping Heuristic
David Aldous.
(1988)
Random walks on finite groups and rapidly mixing Markov chains
David J. Aldous.
Lecture Notes in Mathematics (1983)
Shuffling Cards and Stopping Times
David Aldous;Persi Diaconis.
American Mathematical Monthly (1986)
Lower bounds for covering times for reversible Markov chains and random walks on graphs
David J. Aldous.
Journal of Theoretical Probability (1989)
Stopping Times and Tightness. II
David Aldous.
Annals of Probability (1978)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of California, Berkeley
École Normale Supérieure
Stanford University
University of California, Berkeley
Indiana University
School for Advanced Studies in the Social Sciences
The Ohio State University
University of California, Berkeley
University of Oxford
University of Pennsylvania
MIT
Spanish National Research Council
Nara Institute of Science and Technology
University of Liège
National University of Singapore
Centre national de la recherche scientifique, CNRS
Emory University
Public Health England
University of South Florida
Centre for Addiction and Mental Health
Aix-Marseille University
Claude Bernard University Lyon 1
University of Pennsylvania
Brown University
Ludwig-Maximilians-Universität München
United States Naval Research Laboratory