David Aldous studies probability theory and random combinatorial structures. His random-walk construction of a uniform spanning tree keeps the first-entrance edge for each newly visited vertex of a finite connected graph.[ref]
Those edges necessarily form a tree, but their uniform distribution requires a separate argument. The construction permits properties of random trees—degrees, leaves and diameter—to be studied through random walks. Its running time is tied to the walk's cover time, giving a direct link between a stochastic exploration process and a combinatorial sampling algorithm.[ref]
Articles by others on the same topic
David Aldous is a prominent statistician and mathematician known for his work in probability theory and stochastic processes. He is particularly recognized for contributions to fields such as statistical physics, probability models, and combinatorial structures. One of his notable works is related to the Aldous–Broder algorithm for generating uniform spanning trees, and he has also made significant contributions to the understanding of percolation theory and random walks. Aldous has held academic positions and has published extensively in his field.