David Aldous
#21,842
Most Influential Person Now
British-American mathematician
David Aldous's AcademicInfluence.com Rankings
David Aldousmathematics Degrees
Mathematics
#1281
World Rank
#2139
Historical Rank
Probability Theory
#9
World Rank
#22
Historical Rank
Measure Theory
#456
World Rank
#652
Historical Rank
Download Badge
Mathematics
Why Is David Aldous Influential?
(Suggest an Edit or Addition)According to Wikipedia, David John Aldous FRS 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. Aldous was on the faculty at University of California, Berkeley from 1979 until his retirement in 2018.
David Aldous's Published Works
Published Works
- Exchangeability and related topics (1985) (1589)
- The Continuum Random Tree III (1991) (765)
- Lower bounds for covering times for reversible Markov chains and random walks on graphs (1989) (661)
- The Central Limit Theorem for Real and Banach Valued Random Variables (1981) (631)
- Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists (1999) (618)
- Probability Approximations via the Poisson Clumping Heuristic (1988) (594)
- Random walks on finite groups and rapidly mixing markov chains (1983) (542)
- SHUFFLING CARDS AND STOPPING-TIMES (1986) (493)
- Representations for partially exchangeable arrays of random variables (1981) (462)
- Processes on Unimodular Random Networks (2006) (454)
- Stochastic Analysis: The Continuum random tree II: an overview (1991) (449)
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem (1999) (439)
- The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence (2004) (420)
- Stopping Times and Tightness. II (1978) (363)
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees (1990) (314)
- On Mixing and Stability of Limit Theorems (1978) (302)
- Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today (2001) (287)
- Strong uniform times and finite random walks (1987) (282)
- Brownian excursions, critical random graphs and the multiplicative coalescent (1997) (274)
- PROBABILITY DISTRIBUTIONS ON CLADOGRAMS (1996) (248)
- A survey of max-type recursive distributional equations (2004) (229)
- Hammersley's interacting particle process and longest increasing subsequences (1995) (216)
- The ζ(2) limit in the random assignment problem (2000) (193)
- Asymptotic Fringe Distributions for General Families of Random Trees (1991) (189)
- Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels (1987) (181)
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing (1987) (160)
- The standard additive coalescent (1998) (160)
- Asymptotics in the random assignment problem (1992) (149)
- Some Inequalities for Reversible Markov Chains (1982) (148)
- Review: Stewart N. Ethier and Thomas G. Kurtz, Markov processes: Characterization and convergence (1987) (131)
- Tree-valued Markov chains derived from Galton-Watson processes (1998) (124)
- "Go with the winners" algorithms (1994) (118)
- Asymptotics for Euclidean minimal spanning trees on random points (1992) (112)
- Tree-based models for random distribution of mass (1993) (105)
- A critical branching process model for biodiversity (2004) (100)
- Brownian bridge asymptotics for random mappings (1992) (96)
- A diffusion limit for a class of randomly-growing binary trees (1988) (88)
- Connected Spatial Networks over Random Points and a Route-Length Statistic (2010) (80)
- Inequalities for rare events in time-reversible Markov chains II (1993) (78)
- On the time taken by random walks on finite groups to visit every state (1983) (78)
- Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent (2000) (76)
- The Asymmetric One-Dimensional Constrained Ising Model: Rigorous Results (2001) (75)
- Unconditional bases and martingales in LP(F) (1979) (74)
- Minimization Algorithms and Random Walk on the $d$-Cube (1983) (74)
- RECURSIVE SELF-SIMILARITY FOR RANDOM TREES, RANDOM TRIANGULATIONS AND BROWNIAN EXCURSION (1994) (70)
- Markov chains with almost exponential hitting times (1982) (69)
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains (1988) (68)
- An introduction to covering problems for random walks on graphs (1989) (68)
- The Entrance Boundary of the Multiplicative Coalescent (1998) (65)
- Threshold limits for cover times (1991) (64)
- Mixing times for uniformly ergodic Markov chains (1997) (62)
- Triangulating the Circle, at Random (1994) (59)
- Limit theorems for subsequences of arbitrarily-dependent sequences of random variables (1977) (57)
- The percolation process on a tree where infinite clusters are frozen (2000) (57)
- A Random Tree Model Associated with Random Graphs (1990) (56)
- Meeting times for independent Markov chains (1991) (54)
- A Markovian extension of Valiant's learning model (1990) (54)
- Random walk covering of some special trees (1991) (51)
- Short-length routes in low-cost networks via Poisson line patterns (2007) (50)
- Probability and Mathematical Genetics: More uses of exchangeability: representations of complex random structures (2009) (48)
- Hitting times for random walks on vertex-transitive graphs (1989) (48)
- Mixing Time for a Markov Chain on Cladograms (2000) (48)
- Interacting particle systems as stochastic social dynamics (2013) (45)
- On a random graph with immigrating vertices: Emergence of the giant component (2000) (41)
- The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin’s local time identity (2004) (40)
- Subspaces of ¹, via random measures (1981) (39)
- Random Discrete Structures (1996) (38)
- Brownian Excursion Conditioned on Its Local Time (1998) (33)
- Some interesting processes arising as heavy traffic limits in an M/M/∞ storage process (1986) (33)
- A lecture on the averaging process (2012) (33)
- The asymmetric one-dimensional constrained Ising model (2001) (32)
- A family of random trees with random edge lengths (1999) (32)
- Microsurveys in Discrete Probability (1998) (32)
- Scaling and universality in continuous length combinatorial optimization (2003) (31)
- Elo Ratings and the Sports Model: A Neglected Topic in Applied Probability? (2017) (28)
- Tree-valued Markov chains and Poisson-Galton-Watson distributions (1997) (27)
- Stochastic models for phylogenetic trees on higher-order taxa (2007) (26)
- On the Zero-one Law for Exchangeable Events (1979) (26)
- Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees (2004) (26)
- Discrete probability and algorithms (1995) (26)
- Emergence of the giant component in special Marcus-Lushnikov processes (1998) (25)
- True scale-invariant random spatial networks (2012) (23)
- Weak convergence of randomly indexed sequences of random variables (1978) (22)
- Five statistical questions about the tree of life. (2011) (22)
- On Simulating a Markov Chain Stationary Distribution when Transition Probabilities are Unknown (1995) (22)
- The harmonic mean formula for probabilities of unions: applications to sparse random graphs (1989) (22)
- The number of extreme points in the convex hull of a random sample (1991) (21)
- Colacunary sequences in L-spaces (1982) (20)
- Edge flows in the complete random‐lengths network (2007) (19)
- Dirichlet Forms on Totally Disconnected Spaces and Bipartite Markov Chains (1999) (19)
- The ‘birth-and-assassination’ process (1990) (18)
- Exchangeability and Continuum Limits of Discrete Random Structures (2011) (17)
- Invariance Principles for Non-Uniform Random Mappings and Trees (2002) (16)
- When Knowing Early Matters: Gossip, Percolation and Nash Equilibria (2010) (16)
- Two Recursive Decompositions of Brownian Bridge Related to the Asymptotics of Random Mappings (2006) (16)
- Finite-time implications of relaxation times for stochastically monotone processes (1988) (16)
- Scale-invariant random spatial networks (2014) (15)
- Which Connected Spatial Networks on Random Points have Linear Route-Lengths? (2009) (15)
- Self-intersections of 1-dimensional random walks (1986) (15)
- Greedy Search on the Binary Tree with Random Edge-Weights (1992) (15)
- Percolation–like scaling exponents for minimal paths and trees in the stochastic mean field model (2005) (15)
- Probability, Statistics and Analysis: The asymptotic speed and shape of a particle system (1983) (13)
- SUBSPACES OF L1, VIA RANDOM MEASURES (2010) (13)
- A Characterisation of Hilbert Space Using the Central Limit Theorem (1976) (13)
- The Incipient Giant Component in Bond Percolation on General Finite Weighted Graphs (2016) (13)
- Optimal geometry of transportation networks. (2019) (13)
- ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES (2013) (13)
- Spatial transportation networks with transfer costs: asymptotic optimality of hub-and-spoke models (2007) (12)
- The asymptotic distribution of the diameter of a random mapping (2002) (12)
- Uniform multicommodity flow through the complete graph with random edge-capacities (2009) (12)
- A Tractable Complex Network Model Based on the Stochastic Mean-Field Model of Distance (2003) (12)
- Stein's method in a two-dimensional coverage problem (1989) (11)
- On countable dense random sets (1981) (10)
- The zeta(2) limit in the random assignment problem (2000) (10)
- Applications of Random Walks on Finite Graphs (1991) (10)
- Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited (1992) (10)
- A Metropolis-Type Optimization Algorithm on the Infinite Tree (1998) (10)
- Percolating paths through random points (2005) (10)
- The Shape Theorem for Route-lengths in Connected Spatial Networks on Random Points (2009) (10)
- Hashing with Linear Probing under Nonuniform Probabilities (1988) (9)
- Using Prediction Market Data to Illustrate Undergraduate Probability (2013) (9)
- When Can One Test an Explanation? Compare and Contras Benford’s Law and the Fuzzy CLT (2010) (9)
- Optimal spatial transportation networks where link costs are sublinear in link capacity (2008) (8)
- Weak Concentration for First Passage Percolation Times on Graphs and General Increasing Set-valued Processes (2016) (8)
- A stochastic complex network model (2003) (8)
- Darwin's log: a toy model of speciation and extinction (1995) (8)
- Exact Mixing in an Unknown Markov Chain (1995) (8)
- On the Critical Value for ‘Percolation’ of Minimum-Weight Trees in the Mean-Field Distance Model (1998) (7)
- The compulsive gambler process (2014) (7)
- Waves in a spatial queue (2017) (7)
- Reorganizing Large Web Sites (2001) (7)
- The great filter, branching histories, and unlikely events (2012) (7)
- The Eigenvalue Method (1989) (7)
- Spin Glasses: A Challenge for Mathematicians.: A Challenge for Mathematicians. (2005) (7)
- The Rules of Contagion: Why Things Spread—And Why They Stop (2022) (6)
- Routed planar networks (2016) (6)
- Chapter 3 Reversible Markov Chains (1994) (5)
- Optimal flow through the disordered lattice (2005) (5)
- Random partitions of the plane via Poissonian coloring and a self-similar process of coalescing planar partitions (2016) (5)
- Cost-Volume Relationship for Flows Through a Disordered Network (2005) (5)
- Tail behavior of birth-and-death and stochastically monotone processes (1983) (5)
- Poisson Clumping Heuristic (2006) (5)
- Book Review: Probability on graphs: random processes on graphs and lattices (2013) (5)
- Models for Connected Networks over Random Points and a Route-Length Statistic (2008) (4)
- Near-Minimal Spanning Trees: a Scaling Exponent in Probability Models (2006) (4)
- Markov Chains and Mixing Times (Second Edition) by David A. Levin and Yuval Peres (2018) (4)
- Subsequences of sequences of random variables (1977) (4)
- Dynamic Programming Optimization over Random Data: The Scaling Exponent for Near-Optimal Solutions (2007) (4)
- A Prediction Tournament Paradox (2019) (4)
- Chapter 9 a Second Look at General Markov Chains (1995) (4)
- Probability Approximations via the Poisson Clumping Heuristic: an Update General Remarks (1992) (4)
- A Route-Length Efficiency Statistic for Road Networks (2009) (3)
- Self-intersections of random walks on discrete groups (1985) (3)
- How to Combine Fast Heuristic Markov Chain Monte Carlo with Slow Exact Sampling (2001) (3)
- Approximate Counting via Markov Chains (1993) (3)
- Empires and percolation: stochastic merging of adjacent regions (2009) (3)
- THE CONTINUUM RANDOM TREE. I1 (2018) (3)
- On the Largest Common Subtree of Random Leaf-Labeled Binary Trees (2020) (3)
- MSC Assessment Report for USA Sea Scallop Fishery (2013) (3)
- Two recursive decompositions of Brownian bridge (2004) (3)
- Spatial networks. A complete introduction: from graph theory and statistical physics to real-world applications. (2022) (3)
- Microsurveys in discrete probability : DIMACS workshop, June 2-6, 1997 (1998) (3)
- The Moran Process as a Markov Chain on Leaf-labeled Trees (1999) (3)
- The Life and Mathematical Legacy of Thomas M. Liggett (2020) (2)
- A Framework for Imperfectly Observed Networks (2018) (2)
- The stretch-length tradeoff in geometric networks: average case and worst case study (2014) (2)
- A tree-based scaling exponent for random cluster models (1992) (2)
- Another Conversation with Persi Diaconis (2013) (2)
- To stay discovered: On tournament mean score sequences and the Bradley–Terry model (2018) (2)
- Financial Risk Management… for Dummies (2016) (2)
- Advances in turfgrass science and management in Australasia. (2000) (2)
- Book review. The black Swan: the Impact of the highly improbable (2011) (2)
- Research on Modern Implications of Pairs Trading (2012) (2)
- Covering a compact space by fixed-radius or growing random balls (2021) (2)
- The Stretch-Length Tradeoff in Geometric Networks: Worst-case and Average case Study (2008) (2)
- Online Random Weight Minimal Spanning Trees and a Stochastic Coalescent (2008) (2)
- Title Spatial transportation networks with transfer costs : Asymptotic optimality of huband-spoke models (2008) (1)
- The SI and SIR epidemics on general networks (2018) (1)
- Exponential Combinatorial Extrema (1989) (1)
- Fluctuations of martingales and winning probabilities of game contestants (2012) (1)
- Exploitation of synchronous digital hierarchy features to provide multidestination satellite communications (1993) (1)
- Probability: Theory and Examples - R. Durrett. (1991) (1)
- Chapter 4 Hitting and Convergence Time, and Flow Rate, Parameters for Reversible Markov Chains (1994) (1)
- Teacher's Corner When Can One Test an Explanation? Compare and Contrast Benford's Law and the Fuzzy CLT (2010) (1)
- Introducing Nash Equilibria via an Online Casual Game That People Actually Play (2017) (1)
- Markov chains derived from Galton-Watson processes (1997) (1)
- Exploring Endless Space (2023) (1)
- Coherent Stochastic Models for Macroevolution (2004) (1)
- The Critical Beta-splitting Random Tree II: Overview and Open Problems (2023) (1)
- OPTIMAL FLOW THROUGH THE DISORDERED LATTICE 1 (2007) (1)
- The Critical Beta-splitting Random Tree: Heights and Related Results (2023) (1)
- Introduction to the Interface of Probability and Algorithms (1993) (1)
- Predicting Premier League Final Points and Rank Using Linear Modeling Techniques (2016) (0)
- A Conversation with Jim Pitman (2018) (0)
- SIR EPIDEMICS ON GENERAL NETWORKS (2017) (0)
- Chapter 6 Cover Times (1994) (0)
- [The Unity and Diversity of Probability]: Comment (1990) (0)
- Title The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees Permalink (2018) (0)
- Parking on the infinite binary tree (2022) (0)
- Chapter 15 Innnite Graphs (1996) (0)
- Second Errata to “Processes on Unimodular Random Networks” (2019) (0)
- Analyzing the Risk of Mortgage Default Grace Deng Statistics (2016) (0)
- A Spatial Model of City Growth and Formation (2012) (0)
- Combinatorics for Processes (1989) (0)
- Title Asymptotics for Euclidean minimal spanning trees on random points Permalink (2005) (0)
- Taking Chances: Winning with Probability. By John Haigh (2000) (0)
- 2015 Herbert Howe Lecture in Mathematics (2015) (0)
- On the stability of a batch clearing system with Poisson arrivals and subadditive service times (2001) (0)
- Submitted to the Annals of Probability RANDOM PARTITIONS OF THE PLANE VIA POISSONIAN COLORING , AND A SELF-SIMILAR PROCESS OF COALESCING PLANAR PARTITIONS By (2017) (0)
- A Framework for Imperfectly Observed Networks (2017) (0)
- Chapter 7 Symmetric Graphs and Chains (1994) (0)
- Ja n 20 05 Percolation-like Scaling Exponents for Minimal Paths and Trees in the Stochastic Mean Field Model (2005) (0)
- Route lengths in invariant spatial tree networks (2021) (0)
- Spatial Networks (2017) (0)
- Brownian Motion: Local Distributions (1989) (0)
- Markov chains in computer science learning and optimization-by-voting models (1991) (0)
- Multi-Dimensional Diffusions (1989) (0)
- Markov Chains and Mixing Times (Second Edition) by David A. Levin and Yuval Peres (2018) (0)
- A real-world Markov chain arising in recreational volleyball (2021) (0)
- Random Eulerian Circuits (2014) (0)
- Threshold Phenomena in an "easy" Class of Random Lattices and Eecient Reduction Algorithms Random Assignment Problem and Asymptotic Essential Uniqueness in Optimization over Random Data the Kernel Method the Height and Width of Simple Trees (0)
- Lecture 2 : Branching Processes (2007) (0)
- Extremes of Locally Brownian Processes (1989) (0)
- Waves in a Spatial Queue: Stop-and-Go at Airport Security (2015) (0)
- Markov Chain Hitting Times (1989) (0)
- A Note on Probabilistic Analysis of a Sparse Matrix Factorization Scheme and Random Graphs (1993) (0)
- A pr 2 01 2 Scale-invariant random spatial networks (2012) (0)
- Gambling Under Unknown Probabilities as Proxy for Real World Decisions Under Uncertainty (2023) (0)
- Noise: A Flaw in Human Judgment by Daniel Kahneman, Olivier Sibony, and Cass R. Sunstein (2022) (0)
- Scale-invariant random (2014) (0)
- New Results - Combinatorial Optimization and Analysis of Algorithms (2007) (0)
- Chapter 5 Examples: Special Graphs and Trees (1996) (0)
- Title The great filter , branching histories , and unlikely events Permalink (2010) (0)
- Errata to “Processes on unimodular random networks” (2017) (0)
- Extremes of Stationary Processes (1989) (0)
- New Results - Point Processes, Stochastic Geometry and Random Graphs (2004) (0)
- Title Scale-invariant random spatial networks (2014) (0)
- WALD MEMORIAL LECTURE RECURSIVE SELF-SIMILARITY FOR RANDOM TREES , RANDOM TRIANGULATIONSAND BROWNIAN EXCURSION (1994) (0)
- Mathematical Analysis of Subjectively Dened Coincidences; a case study using Wikipedia (2008) (0)
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS (2019) (0)
- Patience Sorting , Longest Increasing Subsequences and a Continuous Space Analog of the Simple Asymmetric Exclusion Process (2017) (0)
- The harmonic mean formula for combinatorial and D-parameter extrema (1987) (0)
- Chapter 14 Interacting Particles on Finite Graphs (1994) (0)
- Title Cost-volume relationship for flows through a disordered network Permalink (2008) (0)
- Statistical Analysis of Nuel Tournaments (2013) (0)
- Cost effectiveness in parks management. (1982) (0)
- Introduction (2020) (0)
- Planning aspects of the IS-VII program (1989) (0)
- International Turf Management (2014) (0)
- Book Review: Evolution of random search trees (1992) (0)
- Bibliography of David Aldous (2003) (0)
- Book review (1991) (0)
- David Aldous Interview July 21, 2012 (2012) (0)
- JPR volume 38 issue 2 Cover and Front matter (2001) (0)
This paper list is powered by the following services:
Other Resources About David Aldous
What Schools Are Affiliated With David Aldous?
David Aldous is affiliated with the following schools: