Return to David Aldous's home page
Overhead slides from recent talks.
Occasionally some material is missing (hand-drawn figures or
figures copied from other sources).
Some broad questions about the Tree of Life. Newton Institute, Cambridge, December 2007.
When Knowing Early Matters: Gossip, Percolation and Nash Equilibria. ICTP, Trieste, July 2007.
Short length routes in low cost networks Talk by co-author Wilf Kendall, September 2007: much better than my talks! As is this poster presentation.
Spatial random Networks Various places, October 2006 - May 2007. Later vesion is above.
Flows through random networks. SPASWIN, Boston, April 2006.
Optimal flow through the disordered lattice Berkeley, February 2006.
Flows through random networks. INFORMS, Ottawa, July 2005.
Percolating paths through random points Oberwolfach, May '05.
A Tractable Complex Network Model Cornell, U.C.L.A, March 2005.
Local weak convergence of random networks: towards the cavity method MSRI Berkeley, March 2005.
Constrained Ising models and speculative application to sensor networks Confererence in honor of Persi Diaconis, UC San Diego, January 2005.
Workshop Introduction: Models of real-world networks MSRI, Berkeley, January '05.
Random graphs, the multiplicative coalescent and percolation of tree-averages Newton Institute, December '03.
Mean-field combinatorial optimization, fixed point equations, and local weak convergence Berkeley, November '02; UCSB, December '02; Stanford, February '03, Microsoft Research, February '03.
Maximum partial matchings on random trees; an illustration of the local weak convergence methodology. Colloque Informatique et Mathematiques, Versailles, September '02.
A survey of max-type recursive distributional equations. Probability Symposium, Banff, July '02.
How to Combine Fast Heuristic Markov Chain Monte Carlo with Slow Exact Sampling SPA conference, Cambridge, July '01.
Mathematical Probability: some topics we understand, some we don't The Mordell Lecture, University of Cambridge, May '01.
Random graphs and complex networks. Berkeley (March '01).
The zeta(2) limit in the random assignment problem. Berkeley (October '00), Stanford (December '00).
The Asymmetric One-Dimensional Constrained Ising Model: Rigorous Results Berkeley (March '00), Stanford (February '00), Madison (February '02).
Lecture 1 Coalescence in physical science; the basic deterministic and stochastic models.
Lecture 2 The gelation phase transition and the multiplicative case.
Lecture 3 Overview of stochastic coalescence results; the additive case.
Lecture 4 The hashing (parking) model: recent work of Chassaing-Louchard and Bertoin on the additive case.
Return to David Aldous's home page