David J. Aldous

Mathematical Physics · 1989–2017

A researcher in the Science corpus: 11 papers; trusts 36 researchers and is trusted by 53 researchers here, as inferred from the citation graph.

Subfields

• Mathematical Physics — 28 citations into it; #362 of 8,562 by trust here, #686 by citations
• Statistics and Probability — 13 citations into it; #1,227 of 12,932 by trust here, #1,887 by citations
• Artificial Intelligence — 11 citations into it; #12,596 of 35,345 by trust here, #24,417 by citations
• Geometry and Topology — 11 citations into it
• Computational Theory and Mathematics — 10 citations into it
• Probabilistic & Bayesian Methods — 8 citations into it
• Condensed Matter Physics — 7 citations into it; #603 of 1,948 by trust here, #1,616 by citations
• Discrete Mathematics and Combinatorics — 7 citations into it; #84 of 2,017 by trust here, #129 by citations

Whom David J. Aldous trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Itai Benjamini
2. Russell Impagliazzo
3. Lea Popovic
4. Lars Magnus Hvattum
5. Jim Pitman
6. Mathew D. Penrose
7. M. M'ezard
8. Oded Schramm
9. Jean Bertoin
10. Persi Diaconis

Who trusts David J. Aldous overall

1. Charles Bordenave
2. Tim Austin
3. Grégory Miermont
4. Pietro Caputo
5. Shankar Bhamidi
6. Mathew D. Penrose
7. Johan Wästlund
8. Karl W. Broman
9. Daniel J. Ford
10. Amir Dembo

Papers from David J. Aldous's perspective

Ordered by how strongly the researchers David J. Aldous trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence
2. Recurrence of Distributional Limits of Finite Planar Graphs
3. Uniform Infinite Planar Triangulations
4. Combinatorial Stochastic Processes
5. Growth and percolation on the uniform infinite planar triangulation
6. Limits of dense graph sequences (J. Comb. Theory B)
7. Graph limits and exchangeable random graphs
8. On exchangeable random variables and the statistics of large graphs and hypergraphs
9. Review: P. Billingsley, Convergence of probability measures
10. Weak laws of large numbers in geometric probability

Their papers

• Elo Ratings and the Sports Model: A Neglected Topic in Applied Probability? (2017) — 56 citations
• The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence (2004) — 478 citations
• Processes on Unimodular Random Networks (2006) — 534 citations
• A survey of max-type recursive distributional equations (2004) — 245 citations
• A critical branching process model for biodiversity (2004) — 109 citations
• A lecture on the averaging process (2012) — 50 citations
• Probability and Mathematical Genetics: More uses of exchangeability: representations of complex random structures (2009) — 49 citations
• Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today (2001) — 324 citations
• Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent (2000) — 80 citations
• Mixing Time for a Markov Chain on Cladograms (2000) — 50 citations
• Lower bounds for covering times for reversible Markov chains and random walks on graphs (1989)