×

A conversation with David J. Aldous. (English) Zbl 07612075

Summary: David John Aldous was born in Exeter U.K. on July 13, 1952. He received a B.A. and Ph.D. in Mathematics in 1973 and 1977, respectively from Cambridge. After spending two years as a research fellow at St. John’s College, Cambridge, he joined the Department of Statistics at the University of California, Berkeley in 1979 where he spent the rest of his academic career until retiring in 2018. He is known for seminal contributions on many topics within probability including weak convergence and tightness, exchangeability, Markov chain mixing times, Poisson clumping heuristic and limit theory for large discrete random structures including random trees, stochastic coagulation and fragmentation systems, models of complex networks and interacting particle systems on such structures. For his contributions to the field, he has received numerous honors and awards including the Rollo Davidson prize in 1980, the inaugural Loeve prize in Probability in 1993, and the Brouwer medal in 2021, and being elected as an IMS fellow in 1985, Fellow of the Royal Society in 1994, Fellow of the American Academy of Arts and Sciences in 2004, elected to the National Academy of Sciences (foreign associate) in 2010, ICM plenary speaker in 2010 and AMS fellow in 2012.

MSC:

62-XX Statistics

Biographic References:

Aldous, D. J.
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] ALDOUS, D. J. (1977). Limit theorems for subsequences of arbitrarily-dependent sequences of random variables. Z. Wahrsch. Verw. Gebiete 40 59-82. · Zbl 0571.60027 · doi:10.1007/BF00535707
[2] Aldous, D. (1978). Stopping times and tightness. Ann. Probab. 6 335-340. · Zbl 0391.60007 · doi:10.1214/aop/1176995579
[3] ALDOUS, D. J. (1981a). Subspaces of \[{L^1}\], via random measures. Trans. Amer. Math. Soc. 267 445-463. · Zbl 0474.46007 · doi:10.2307/1998664
[4] ALDOUS, D. J. (1981b). Representations for partially exchangeable arrays of random variables. J. Multivariate Anal. 11 581-598. · Zbl 0474.60044 · doi:10.1016/0047-259X(81)90099-3
[5] ALDOUS, D. (1983). Random walks on finite groups and rapidly mixing Markov chains. In Seminar on Probability, XVII. Lecture Notes in Math. 986 243-297. Springer, Berlin. · Zbl 0514.60067 · doi:10.1007/BFb0068322
[6] Aldous, D. J. (1985). Exchangeability and related topics. In École d’été de Probabilités de Saint-Flour, XIII—1983. Lecture Notes in Math. 1117 1-198. Springer, Berlin. · Zbl 0549.00022 · doi:10.1007/BFb0099421
[7] ALDOUS, D. (1989). Probability Approximations via the Poisson Clumping Heuristic. Applied Mathematical Sciences 77. Springer, New York. · Zbl 0679.60013 · doi:10.1007/978-1-4757-6283-9
[8] ALDOUS, D. J. (1990). The random walk construction of uniform spanning trees and uniform labelled trees. SIAM J. Discrete Math. 3 450-465. · Zbl 0717.05028 · doi:10.1137/0403039
[9] Aldous, D. (1991a). The continuum random tree. I. Ann. Probab. 19 1-28. · Zbl 0722.60013
[10] Aldous, D. (1991b). The continuum random tree. II. An overview. In Stochastic Analysis (Durham, 1990). London Mathematical Society Lecture Note Series 167 23-70. Cambridge Univ. Press, Cambridge. · Zbl 0791.60008 · doi:10.1017/CBO9780511662980.003
[11] Aldous, D. (1992). Asymptotics in the random assignment problem. Probab. Theory Related Fields 93 507-534. · Zbl 0767.60006 · doi:10.1007/BF01192719
[12] Aldous, D. (1993). The continuum random tree. III. Ann. Probab. 21 248-289. · Zbl 0791.60009
[13] Aldous, D. (1997). Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25 812-854. · Zbl 0877.60010 · doi:10.1214/aop/1024404421
[14] Aldous, D. J. (1999). Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists. Bernoulli 5 3-48. · Zbl 0930.60096 · doi:10.2307/3318611
[15] Aldous, D. J. (2001). The \[\zeta (2)\] limit in the random assignment problem. Random Structures Algorithms 18 381-418. · Zbl 0993.60018 · doi:10.1002/rsa.1015
[16] ALDOUS, D. J. (2004). A tractable complex network model based on the stochastic mean-field model of distance. In Complex Networks. Lecture Notes in Physics 650 51-87. Springer, Berlin. · Zbl 1080.05532 · doi:10.1007/978-3-540-44485-5_3
[17] ALDOUS, D. (2013a). Another conversation with Persi Diaconis. Statist. Sci. 28 269-281. · Zbl 1331.60004 · doi:10.1214/12-sts404
[18] ALDOUS, D. J. (2013b). Using prediction market data to illustrate undergraduate probability. Amer. Math. Monthly 120 583-593. · Zbl 1280.91136 · doi:10.4169/amer.math.monthly.120.07.583
[19] ALDOUS, D. (2016a). The incipient giant component in bond percolation on general finite weighted graphs. Electron. Commun. Probab. 21 Paper No. 68, 9 pp. · Zbl 1348.60136 · doi:10.1214/16-ECP21
[20] ALDOUS, D. J. (2016b). Weak concentration for first passage percolation times on graphs and general increasing set-valued processes. ALEA Lat. Am. J. Probab. Math. Stat. 13 925-940. · Zbl 1350.60098
[21] ALDOUS, D. (2017). Waves in a spatial queue. Stoch. Syst. 7 197-236. · Zbl 1364.60108 · doi:10.1287/15-SSY208
[22] ALDOUS, D. J. (2021). A prediction tournament paradox. Amer. Statist. 75 243-248. · Zbl 07632861 · doi:10.1080/00031305.2019.1604430
[23] ALDOUS, D. and BARTHELEMY, M. (2019). Optimal geometry of transportation networks. Phys. Rev. E 99 052303. · doi:10.1103/PhysRevE.99.052303
[24] ALDOUS, D. J. and BHAMIDI, S. (2010). Edge flows in the complete random-lengths network. Random Structures Algorithms 37 271-311. · Zbl 1209.05115 · doi:10.1002/rsa.20306
[25] ALDOUS, D. and DIACONIS, P. (1986). Shuffling cards and stopping times. Amer. Math. Monthly 93 333-348. · Zbl 0603.60006 · doi:10.2307/2323590
[26] ALDOUS, D. and DIACONIS, P. (1987). Strong uniform times and finite random walks. Adv. in Appl. Math. 8 69-97. · Zbl 0631.60065 · doi:10.1016/0196-8858(87)90006-6
[27] ALDOUS, D. and DIACONIS, P. (1995). Hammersley’s interacting particle process and longest increasing subsequences. Probab. Theory Related Fields 103 199-213. · Zbl 0836.60107 · doi:10.1007/BF01204214
[28] ALDOUS, D. and DIACONIS, P. (1999). Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem. Bull. Amer. Math. Soc. (N.S.) 36 413-432. · Zbl 0937.60001 · doi:10.1090/S0273-0979-99-00796-X
[29] ALDOUS, D. and FILL, J. (2002). Reversible Markov chains and random walks on graphs.
[30] ALDOUS, D. and GANESAN, K. (2013). True scale-invariant random spatial networks. Proc. Natl. Acad. Sci. USA 110 8782-8785. · Zbl 1292.60014 · doi:10.1073/pnas.1304329110
[31] ALDOUS, D. J. and KENDALL, W. S. (2008). Short-length routes in low-cost networks via Poisson line patterns. Adv. in Appl. Probab. 40 1-21. · Zbl 1167.60004 · doi:10.1239/aap/1208358883
[32] ALDOUS, D. and LIMIC, V. (1998). The entrance boundary of the multiplicative coalescent. Electron. J. Probab. 3 no. 3, 59 pp. · Zbl 0889.60080 · doi:10.1214/EJP.v3-25
[33] Aldous, D. and Lyons, R. (2007). Processes on unimodular random networks. Electron. J. Probab. 12 1454-1508. · Zbl 1131.60003 · doi:10.1214/EJP.v12-463
[34] ALDOUS, D., MIERMONT, G. and PITMAN, J. (2005). Weak convergence of random \(p\)-mappings and the exploration process of inhomogeneous continuum random trees. Probab. Theory Related Fields 133 1-17. · Zbl 1078.60006 · doi:10.1007/s00440-004-0407-2
[35] Aldous, D. and Pitman, J. (1998). The standard additive coalescent. Ann. Probab. 26 1703-1726. · Zbl 0936.60064 · doi:10.1214/aop/1022855879
[36] ALDOUS, D. and POPOVIC, L. (2005). A critical branching process model for biodiversity. Adv. in Appl. Probab. 37 1094-1115. · Zbl 1099.92053 · doi:10.1239/aap/1134587755
[37] ALDOUS, D. J. and SHUN, J. (2010). Connected spatial networks over random points and a route-length statistic. Statist. Sci. 25 275-288. · Zbl 1329.60009 · doi:10.1214/10-STS335
[38] Aldous, D. and Steele, J. M. (2004). The objective method: Probabilistic combinatorial optimization and local weak convergence. In Probability on Discrete Structures. Encyclopaedia Math. Sci. 110 1-72. Springer, Berlin. · Zbl 1037.60008 · doi:10.1007/978-3-662-09444-0_1
[39] AUSTIN, T. (2012). Exchangeable random arrays. In Notes for IAS Workshop.
[40] Baik, J., Deift, P. and Johansson, K. (1999). On the distribution of the length of the longest increasing subsequence of random permutations. J. Amer. Math. Soc. 12 1119-1178. · Zbl 0932.05001 · doi:10.1090/S0894-0347-99-00307-0
[41] BAILEY, N. T. J. (1957). The Mathematical Theory of Epidemics. Hafner Publishing Co., New York.
[42] BARBOUR, A. D., HOLST, L. and JANSON, S. (1992). Poisson Approximation. Oxford Studies in Probability 2. The Clarendon Press, Oxford Univ. Press, New York. · Zbl 0746.60002
[43] BARTHÉLEMY, M. (2011). Spatial networks. Phys. Rep. 499 1-101. · doi:10.1016/j.physrep.2010.11.002
[44] BARTHELEMY, M. (2018). Morphogenesis of Spatial Networks. Lecture Notes in Morphogenesis. Springer, Cham. · Zbl 1382.90001 · doi:10.1007/978-3-319-20565-6
[45] BAYER, D. and DIACONIS, P. (1992). Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2 294-313. · Zbl 0757.60003
[46] BENJAMINI, I. and SCHRAMM, O. (2011). Recurrence of distributional limits of finite planar graphs. In Selected Works of Oded Schramm. Volumes 1, 2. Sel. Works Probab. Stat. 533-545. Springer, New York. · Zbl 1248.01043 · doi:10.1007/978-1-4419-9675-6_15
[47] BILLINGSLEY, P. (1968). Convergence of Probability Measures. Wiley Series in Probability and Statistics: Probability and Statistics. Wiley, New York. · Zbl 0172.21201 · doi:10.1002/9780470316962
[48] BREIMAN, L. (1968). Probability. Addison-Wesley Co., Reading, MA. · Zbl 0174.48801
[49] CHUNG, K. L. (1968). A Course in Probability Theory. Harcourt, Brace & World, Inc., New York. · Zbl 0159.45701
[50] Dawid, A. P. (1981). Some matrix-variate distribution theory: Notational considerations and a Bayesian application. Biometrika 68 265-274. · Zbl 0464.62039 · doi:10.1093/biomet/68.1.265
[51] Diaconis, P. (1988). Group Representations in Probability and Statistics. Institute of Mathematical Statistics Lecture Notes—Monograph Series 11. IMS, Hayward, CA. · Zbl 0695.60012
[52] Diaconis, P. and Janson, S. (2008). Graph limits and exchangeable random graphs. Rend. Mat. Appl. (7) 28 33-61. · Zbl 1162.60009
[53] Diaconis, P. and Shahshahani, M. (1981). Generating a random permutation with random transpositions. Z. Wahrsch. Verw. Gebiete 57 159-179. · Zbl 0485.60006 · doi:10.1007/BF00535487
[54] DRAKE, R. L. (1972). A General Mathematics Survey of the Coagulation Equation. In Topics in Current Aerosol Research Pergamon Press, Elmsford.
[55] FREEDMAN, D. (2012). Markov Chains. Holden-Day, San Francisco, CA.
[56] HAMMERSLEY, J. M. (1972). A few seedlings of research. In Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability (Univ. California, Berkeley, Calif., 1970/1971), Vol. I: Theory of Statistics 345-394. Univ. California Press, Berkeley, CA. · Zbl 0236.00018
[57] JANSON, S., KNUTH, D. E., ŁUCZAK, T. and PITTEL, B. (1993). The birth of the giant component. Random Structures Algorithms 4 231-358. · Zbl 0795.05127 · doi:10.1002/rsa.3240040303
[58] KEMENY, J. G. and SNELL, J. L. (1960). Finite Markov Chains. The University Series in Undergraduate Mathematics. D. Van Nostrand Co., Inc., Princeton, NJ. · Zbl 0089.13704
[59] KREPS, D. M. (1981). Arbitrage and equilibrium in economies with infinitely many commodities. J. Math. Econom. 8 15-35. · Zbl 0454.90010 · doi:10.1016/0304-4068(81)90010-0
[60] KUCHARSKI, A. (2020). The Rules of Contagion: Why Things Spread—And Why They Stop. Hachette UK.
[61] LE GALL, J.-F. (1993). The uniform random tree in a Brownian excursion. Probab. Theory Related Fields 96 369-383. · Zbl 0794.60080 · doi:10.1007/BF01292678
[62] Levin, D. A. and Peres, Y. (2017). Markov Chains and Mixing Times. Amer. Math. Soc., Providence, RI. · Zbl 1390.60001 · doi:10.1090/mbk/107
[63] Lovász, L. and Szegedy, B. (2006). Limits of dense graph sequences. J. Combin. Theory Ser. B 96 933-957. · Zbl 1113.05092 · doi:10.1016/j.jctb.2006.05.002
[64] MÉZARD, M. and PARISI, G. (1987). On the solution of the random link matching problems. J. Phys. 48 1451-1459.
[65] PITMAN, J. (2006). Combinatorial Stochastic Processes: Ecole d’Eté de Probabilités de Saint-Flour XXXII—2002. Lecture Notes in Math. 1875. Springer, Berlin. · Zbl 1103.60004
[66] Root, D. H. (1969). The existence of certain stopping times on Brownian motion. Ann. Math. Stat. 40 715-718. · Zbl 0174.21902 · doi:10.1214/aoms/1177697749
[67] SMOLUCHOWSKI, M. V. (1916). Drei vortrage uber diffusion, brownsche bewegung und koagulation von kolloidteilchen. Z. Phys. 17 557-585.
[68] WALI, K. C. (1991). Chandra: A Biography of S. Chandrasekhar. Univ. Chicago Press, Chicago, IL · Zbl 0755.01045 · doi:10.1007/978-1-4899-3472-7_7
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.