D. Aldous

发表

Probability Approximations via the Poisson Clumping Heuristic

D. Aldous, 1988 .

Microsurveys in Discrete Probability

D. Aldous, J. Propp, 1998 .

Processes on Unimodular Random Networks

D. Aldous, R. Lyons, 2006, math/0603062.

Random walks on finite groups and rapidly mixing markov chains

D. Aldous, 1983 .

SHUFFLING CARDS AND STOPPING-TIMES

P. Diaconis, D. Aldous, 1986 .

On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing

D. Aldous, 1987, Probability in the Engineering and Informational Sciences.

Some Inequalities for Reversible Markov Chains

D. Aldous, 1982 .

Asymptotics in the random assignment problem

D. Aldous, 1992 .

Approximate Counting via Markov Chains

D. Aldous, 1993 .

Threshold limits for cover times

D. Aldous, 1991 .

The Central Limit Theorem for Real and Banach Valued Random Variables

D. Aldous, 1981 .

Review: Stewart N. Ethier and Thomas G. Kurtz, Markov processes: Characterization and convergence

D. Aldous, 1987 .

On Simulating a Markov Chain Stationary Distribution when Transition Probabilities are Unknown

D. Aldous, 1995 .

Exact Mixing in an Unknown Markov Chain

E. Denardo, D. Aldous, 1995 .

The ζ(2) limit in the random assignment problem

D. Aldous, 2000, Random Struct. Algorithms.

Strong uniform times and finite random walks

P. Diaconis, D. Aldous, 1987 .

Elo Ratings and the Sports Model: A Neglected Topic in Applied Probability?

D. Aldous, 2017 .

Short-length routes in low-cost networks via Poisson line patterns

D. Aldous, W. Kendall, 2007, Advances in Applied Probability.

An introduction to covering problems for random walks on graphs

D. Aldous, 1989 .

The ζ(2) limit in the random assignment problem

David Aldous, D. Aldous, 2000, Random Struct. Algorithms.

The percolation process on a tree where infinite clusters are frozen

D. Aldous, 2000, Mathematical Proceedings of the Cambridge Philosophical Society.

Chapter 3 Reversible Markov Chains

D. Aldous, J. A. Fill, 1994 .

Triangulating the Circle, at Random

D. Aldous, 1994 .

Lower bounds for covering times for reversible Markov chains and random walks on graphs

David J. Aldous, D. Aldous, 1989 .

Meeting times for independent Markov chains

D. Aldous, 1991 .

Hitting times for random walks on vertex-transitive graphs

D. Aldous, 1989, Mathematical Proceedings of the Cambridge Philosophical Society.

Markov chains with almost exponential hitting times

D. Aldous, 1982 .

Stochastic Analysis: The Continuum random tree II: an overview

D. Aldous, 1991 .

Random walk covering of some special trees

D. Aldous, 1991 .

On the time taken by random walks on finite groups to visit every state

D. Aldous, 1983 .

Minimization Algorithms and Random Walk on the $d$-Cube

D. Aldous, 1983 .

Finite-time implications of relaxation times for stochastically monotone processes

D. Aldous, 1988 .

"Go with the winners" algorithms

Umesh V. Vazirani, David Aldous, D. Aldous, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists

D. Aldous, 1999 .

Probability, Statistics and Analysis: The asymptotic speed and shape of a particle system

D. Aldous, J. Pitman, J. Pitman, 1983 .

A survey of max-type recursive distributional equations

D. Aldous, Antar Bandyopadhyay, 2004, math/0401388.

Hammersley's interacting particle process and longest increasing subsequences

P. Diaconis, D. Aldous, 1995 .

Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem

P. Diaconis, D. Aldous, 1999 .

Probability and Mathematical Genetics: More uses of exchangeability: representations of complex random structures

D. Aldous, 2009, 0909.4339.

PROBABILITY DISTRIBUTIONS ON CLADOGRAMS

D. Aldous, 1996 .

Some interesting processes arising as heavy traffic limits in an M/M/∞ storage process

D. Aldous, 1986 .

Stochastic models for phylogenetic trees on higher-order taxa

D. Aldous, M. Krikun, L. Popovic, 2007, Journal of mathematical biology.

Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today

D. Aldous, 2001 .

Asymptotics for Euclidean minimal spanning trees on random points

J. Michael Steele, David Aldous, J. Steele, 1992 .

On Mixing and Stability of Limit Theorems

David Aldous, G. K. Eagleson, D. Aldous, 1978 .

A Conversation with Jim Pitman

D. Aldous, 2018, Statistical Science.

True scale-invariant random spatial networks

D. Aldous, K. Ganesan, 2012, Proceedings of the National Academy of Sciences.

Optimal spatial transportation networks where link costs are sublinear in link capacity

D. Aldous, 2008, 0803.2037.

Connected Spatial Networks over Random Points and a Route-Length Statistic

D. Aldous, Julian Shun, 2010, 1003.3700.

The ζ(2) limit in the random assignment problem

D. Aldous, 2000, Random Struct. Algorithms.

The asymptotic distribution of the diameter of a random mapping

J. Pitman, D. Aldous, 2002 .

A diffusion limit for a class of randomly-growing binary trees

D. Aldous, P. Shields, 1988 .

Darwin's log: a toy model of speciation and extinction

D. Aldous, 1995 .

Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains

D. Aldous, J. Palacios, Barry Flannery, 1988, Probability in the Engineering and Informational Sciences.

The Incipient Giant Component in Bond Percolation on General Finite Weighted Graphs

D. Aldous, 2016, 1604.06741.

The Asymmetric One-Dimensional Constrained Ising Model: Rigorous Results

Persi Diaconis, David Aldous, P. Diaconis, 2002 .

The number of extreme points in the convex hull of a random sample

David Aldous, Bert Fristedt, William E. Pruitt, 1991 .

Optimal flow through the disordered lattice

David Aldous, D. Aldous, 2007 .

Optimal Flow through the Disordered Lattice 1

D. Aldous, 2007 .

OPTIMAL FLOW THROUGH THE DISORDERED LATTICE1 BY DAVID ALDOUS

D. Aldous, 2007 .

How to Combine Fast Heuristic Markov Chain Monte Carlo with Slow Exact Sampling

D. Aldous, Antar Bandyopadhyay, 2001, math/0106159.

Mixing Time for a Markov Chain on Cladograms

David Aldous, D. Aldous, 2000, Combinatorics, Probability and Computing.

A Prediction Tournament Paradox

D. Aldous, 2019, The American Statistician.

The Moran Process as a Markov Chain on Leaf-labeled Trees

D. Aldous, 1999 .

Chapter 7 Symmetric Graphs and Chains

D. Aldous, J. A. Fill, 1994 .

Chapter 4 Hitting and Convergence Time, and Flow Rate, Parameters for Reversible Markov Chains

D. Aldous, 1994 .

Tree-based models for random distribution of mass

David Aldous, D. Aldous, 1993 .

A Tractable Complex Network Model Based on the Stochastic Mean-Field Model of Distance

D. Aldous, 2004 .

Title The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees Permalink

D. Aldous, 2018 .

A Framework for Imperfectly Observed Networks

D. Aldous, Xiang Li, 2018 .

Weak Concentration for First Passage Percolation Times on Graphs and General Increasing Set-valued Processes

D. Aldous, 2016, 1604.06418.

Markov chains derived from Galton-Watson processes

J. Pitman, D. Aldous, 1997 .

Models for Connected Networks over Random Points and a Route-Length Statistic

D. Aldous, Julian Shun, 2008 .

A stochastic complex network model

D. Aldous, 2003 .

A stochastic complex network model

D. Aldous, 2003 .

Optimal geometry of transportation networks.

Marc Barthelemy, David Aldous, D. Aldous, 2019, Physical review. E.

A pr 2 01 2 Scale-invariant random spatial networks

D. Aldous, 2012 .

Title Scale-invariant random spatial networks

D. Aldous, 2014 .

Title Spatial transportation networks with transfer costs : Asymptotic optimality of huband-spoke models

D. Aldous, 2008 .

A Markovian Extension of Valiant's Learning Model (Extended Abstract)

D. Aldous, U. Vazirani, 1990, IEEE Annual Symposium on Foundations of Computer Science.

The Rules of Contagion: Why Things Spread—And Why They Stop

D. Aldous, 2022, Notices of the American Mathematical Society.

Dynamic Programming Optimization over Random Data: The Scaling Exponent for Near-Optimal Solutions

D. Aldous, M. Lelarge, C. Bordenave, 2007, SIAM J. Comput..

A critical branching process model for biodiversity

D. Aldous, L. Popovic, 2004, Advances in Applied Probability.

Processes on Unimodular Random Networks

D. Aldous, R. Lyons, 2006, math/0603062.

The number of extreme points in the convex hull of a random sample

D. Aldous, B. Fristedt, W. Pruitt, 1991, Journal of Applied Probability.

Short-length routes in low-cost networks via Poisson line patterns

D. Aldous, W. Kendall, 2007, Advances in Applied Probability.

Representations for partially exchangeable arrays of random variables

D. Aldous, 1981 .

Weak Concentration for First Passage Percolation Times on Graphs and General Increasing Set-valued Processes

D. Aldous, 2016, 1604.06418.

To stay discovered: On tournament mean score sequences and the Bradley–Terry model

D. Aldous, Brett Kolesnik, 2018, Stochastic Processes and their Applications.

A Tractable Complex Network Model Based on the Stochastic Mean-Field Model of Distance

D. Aldous, 2003, cond-mat/0304701.

Spatial networks. A complete introduction: from graph theory and statistical physics to real-world applications.

D. Aldous, 2022 .

Optimal flow through the disordered lattice

D. Aldous, 2005, math/0511694.

Scale-invariant random

D. Aldous, 2014 .

A survey of max-type recursive distributional equations

D. Aldous, Antar Bandyopadhyay, 2004, math/0401388.

The Continuum Random Tree III

David Aldous, D. Aldous, 1991 .

Two Recursive Decompositions of Brownian Bridge Related to the Asymptotics of Random Mappings

J. Pitman, D. Aldous, 2006 .

Two recursive decompositions of Brownian bridge

J. Pitman, D. Aldous, 2004, math/0402399.

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

D. Aldous, M. Yor, P. Flajolet, 2022 .

THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS

D. Aldous, 2019, Probability in the Engineering and Informational Sciences.

Dirichlet Forms on Totally Disconnected Spaces and Bipartite Markov Chains

D. Aldous, S. Evans, 1999 .

The zeta(2) limit in the random assignment problem

D. Aldous, 2000, math/0010063.

Percolating paths through random points

D. Aldous, M. Krikun, 2005, math/0509492.

Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees

J. Pitman, D. Aldous, G. Miermont, 2004, math/0401115.

A Framework for Imperfectly Observed Networks

D. Aldous, Xiang-Dong Li, 2017, Journal of statistical physics.

The compulsive gambler process

D. Aldous, J. Salez, D. Lanoue, 2014, 1406.1214.

Tree-valued Markov chains derived from Galton-Watson processes

Jim Pitman, David Aldous, J. Pitman, 1998 .

Chapter 5 Examples: Special Graphs and Trees

D. Aldous, J. A. Fill, 1996 .

The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

David Aldous, D. Aldous, 1990, SIAM J. Discret. Math..

Random Discrete Structures

Robin Pemantle, David Aldous, R. Pemantle, 1996 .

Greedy Search on the Binary Tree with Random Edge-Weights

David Aldous, D. Aldous, 1992, Combinatorics, probability & computing.

Poisson Clumping Heuristic

D. Aldous, 2006 .

Which Connected Spatial Networks on Random Points have Linear Route-Lengths? pdf

David J. Aldous, D. Aldous, 2009, ArXiv.

Interacting particle systems as stochastic social dynamics

David Aldous, D. Aldous, 2013, 1309.6766.

Brownian excursions, critical random graphs and the multiplicative coalescent

David Aldous, D. Aldous, 1997 .

The stretch-length tradeoff in geometric networks: average case and worst case study pdf

Tamar Lando, David Aldous, D. Aldous, 2014, Mathematical Proceedings of the Cambridge Philosophical Society.

The Stretch-Length Tradeoff in Geometric Networks: Worst-case and Average case Study

D. Aldous, Tamar Lando, 2008 .

Invariance Principles for Non-Uniform Random Mappings and Trees

J. Pitman, D. Aldous, 2002 .

Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent

Jim Pitman, David Aldous, J. Pitman, 2000 .

Self-intersections of 1-dimensional random walks

D. Aldous, 1986 .

Brownian bridge asymptotics for random mappings

Jim Pitman, David Aldous, J. Pitman, 1992, Advances in Applied Probability.

Limit theorems for subsequences of arbitrarily-dependent sequences of random variables

David Aldous, D. Aldous, 1977 .

A Metropolis-Type Optimization Algorithm on the Infinite Tree

David Aldous, D. Aldous, 1998, Algorithmica.

Introduction to the Interface of Probability and Algorithms

J. Michael Steele, David Aldous, J. Steele, 1993 .

Stopping Times and Tightness. II

David Aldous, D. Aldous, 1978 .

The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence

J. Michael Steele, David Aldous, J. Steele, 2004 .

Subspaces of ¹, via random measures

D. Aldous, 1981 .

A Markovian extension of Valiant's learning model

Umesh V. Vazirani, David Aldous, D. Aldous, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

A tree-based scaling exponent for random cluster models

D. Aldous, B. Larget, 1992 .

Probability Approximations via the Poisson Clumping Heuristic: an Update General Remarks

David Aldous, D. Aldous, 1992 .

Uniform multicommodity flow through the complete graph with random edge-capacities

Colin McDiarmid, Alex D. Scott, David J. Aldous, 2009, Oper. Res. Lett..

Using Prediction Market Data to Illustrate Undergraduate Probability

David J. Aldous, D. Aldous, 2013, Am. Math. Mon..

Coherent Stochastic Models for Macroevolution

D. Aldous, L. Popovic, Evans Hall, 2004 .

Unconditional bases and martingales in LP(F)

D. Aldous, 1979, Mathematical Proceedings of the Cambridge Philosophical Society.

Scaling and universality in continuous length combinatorial optimization

Allon G. Percus, David Aldous, D. Aldous, 2003, Proceedings of the National Academy of Sciences of the United States of America.

Analyzing the Risk of Mortgage Default Grace Deng Statistics

D. Aldous, 2016 .

Asymptotic Fringe Distributions for General Families of Random Trees

David Aldous, D. Aldous, 1991 .

Routed planar networks

David J. Aldous, D. Aldous, 2016, Electron. J. Graph Theory Appl..

Mixing times for uniformly ergodic Markov chains

Peter Winkler, László Lovász, David Aldous, 1997 .

Another Conversation with Persi Diaconis

David Aldous, D. Aldous, 2013, 1306.3039.

Chapter 9 a Second Look at General Markov Chains

James Allen Fill, David Aldous, D. Aldous, 1995 .

Near-Minimal Spanning Trees: a Scaling Exponent in Probability Models

Marc Lelarge, Charles Bordenave, David Aldous, 2006, math/0609547.

The standard additive coalescent

Jim Pitman, David Aldous, J. Pitman, 1998 .

The Entrance Boundary of the Multiplicative Coalescent

David Aldous, Vlada Limic, D. Aldous, 1998 .

The SI and SIR epidemics on general networks

D. Aldous, 2018 .

A family of random trees with random edge lengths

Jim Pitman, David Aldous, J. Pitman, 1999, Random Struct. Algorithms.

A Random Tree Model Associated with Random Graphs

David Aldous, D. Aldous, 1990, Random Struct. Algorithms.

Tree-valued Markov chains and Poisson-Galton-Watson distributions

David Aldous, D. Aldous, 1997, Microsurveys in Discrete Probability.

The Critical Beta-splitting Random Tree II: Overview and Open Problems

D. Aldous, 2023, 2303.02529.

On the Largest Common Subtree of Random Leaf-Labeled Binary Trees

David J. Aldous, D. Aldous, 2020, SIAM J. Discret. Math..

Exchangeability and Continuum Limits of Discrete Random Structures

David Aldous, D. Aldous, 2011 .

UniversityAnalysis of a Non-Reversible Markov Chain SamplerPersi

Radford M. Neal, P. Diaconis, D. Aldous, 1997 .

RECURSIVE SELF-SIMILARITY FOR RANDOM TREES, RANDOM TRIANGULATIONS AND BROWNIAN EXCURSION

D. Aldous, 1994 .

Applications of Random Walks on Finite Graphs

David Aldous, D. Aldous, 1991 .

Gambling Under Unknown Probabilities as Proxy for Real World Decisions Under Uncertainty

D. Aldous, F. Bruss, 2023, The American mathematical monthly.

The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin’s local time identity

J. Pitman, D. Aldous, G. Miermont, 2004, math/0403137.

Emergence of the giant component in special Marcus-Lushnikov processes

David Aldous, D. Aldous, 1998, Random Struct. Algorithms.

Probability and Mathematical Genetics: More uses of exchangeability: representations of complex random structures

D. Aldous, 2009, 0909.4339.

Gambling Under Unknown Probabilities as Proxy for Real World Decisions Under Uncertainty

D. Aldous, F. Bruss, 2023, Am. Math. Mon..

Weak convergence of randomly indexed sequences of random variables

D. Aldous, 1978, Mathematical Proceedings of the Cambridge Philosophical Society.

The asymmetric one-dimensional constrained Ising model

Persi Diaconis, David Aldous, P. Diaconis, 2001 .

Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent

J. Pitman, D. Aldous, 2000 .

Brownian Bridge Asymptotics for Random Mappings

J. Pitman, D. Aldous, 1994, Random Struct. Algorithms.

Self-intersections of random walks on discrete groups

D. Aldous, 1985, Mathematical Proceedings of the Cambridge Philosophical Society.

Interacting particle systems as stochastic social dynamics

D. Aldous, 2013, 1309.6766.

A lecture on the averaging process

David Aldous, Daniel Lanoue, D. Aldous, 2012 .

On the Critical Value for ‘Percolation’ of Minimum-Weight Trees in the Mean-Field Distance Model

David Aldous, D. Aldous, 1998, Combinatorics, Probability and Computing.

WALD MEMORIAL LECTURE RECURSIVE SELF-SIMILARITY FOR RANDOM TREES , RANDOM TRIANGULATIONSAND BROWNIAN EXCURSION

D. Aldous, 1994 .

Cost-Volume Relationship for Flows Through a Disordered Network

David J. Aldous, D. Aldous, 2005, Math. Oper. Res..

SIR EPIDEMICS ON GENERAL NETWORKS

D. Aldous, 2017 .

Empires and percolation: stochastic merging of adjacent regions

D. Aldous, Jonathan R. Ong, D. J. Aldous, 2009, 0911.0601.

The stretch-length tradeoff in geometric networks: average case and worst case study

D. Aldous, Tamar Lando, 2014, Mathematical Proceedings of the Cambridge Philosophical Society.

On a random graph with immigrating vertices: Emergence of the giant component

Boris G. Pittel, David Aldous, B. Pittel, 2000, Random Struct. Algorithms.

Pulmonary-Allergy, Dermatological, Gastrointestinal & Arthritis Phosphodiesterase 4 inhibitors for the treatment of asthma

D. Aldous, J.-A. Karlsson, 1997 .