David Aldous

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat Connected Spatial Networks over Random Points and a Route-Length Statistic 2010 David Aldous
Julian Shun
2
+ PDF Chat Short-length routes in low-cost networks via Poisson line patterns 2008 David Aldous
Wilfrid S. Kendall
2
+ PDF Chat The Continuum Random Tree. I 1991 David Aldous
2
+ Percolating paths through random points 2005 David Aldous
Maxim Krikun
2
+ Probability Theory and Combinatorial Optimization 1997 John Steele
2
+ Some general dynamical notions 1973 W. H. Gottschalk
1
+ On the Average Number of Edges in Theta Graphs 2013 Pat Morin
Sander Verdonschot
1
+ The Abelian sandpile : a mathematical introduction 2001 Rwj Meester
F. Redig
Dmitri Znamenski
1
+ Percolating paths through random points : 2005 David Aldous
Maxim Krikun
1
+ The Shape Theorem for Route-lengths in Connected Spatial Networks on Random Points 2009 David Aldous
1
+ Studying Self-Organized Criticality with Exactly Solved Models 1999 Deepak Dhar
1
+ Percolation Perturbations in Potential Theory and Random Walks 1998 Itaı Benjamini
Russell Lyons
Oded Schramm
1
+ PDF Chat Monotonicity of uniqueness for percolation on Cayley graphs: all infinite clusters are born simultaneously 1999 Olle HÀggström
Yuval Peres
1
+ PDF Chat The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence 2004 David Aldous
John Steele
1
+ Random graph dynamics 2007 Richard Durrett
1
+ PDF Chat An amenable equivalence relation is generated by a single transformation 1981 Alain Connes
Jacob J. Feldman
Bernard Weiss
1
+ PDF Chat Choosing a Spanning Tree for the Integer Lattice Uniformly 1991 Robin Pemantle
1
+ SOFIC GROUPS AND DYNAMICAL SYSTEMS 2000 Benjamin Weiss
1
+ Uniform spanning forests 2001 Itaı Benjamini
Russell Lyons
Yuval Peres
Oded Schramm
1
+ PDF Chat Scaling laws in the spatial structure of urban road networks 2006 Stefan LĂ€mmer
Björn Gehlsen
Dirk Helbing
1
+ On the independence number of random cubic graphs 1994 Alan Frieze
Stephen Suen
1
+ PDF Chat Minimal spanning forests 2006 Russell Lyons
Yuval Peres
Oded Schramm
1
+ On the expected behavior of disjoint set union algorithms 1985 B BollobĂĄs
IstvĂĄn Simon
1
+ PDF Chat Asymptotics in the random assignment problem 1992 David Aldous
1
+ PDF Chat Monte Carlo Statistical Methods 2000 Hoon Kim
Christian P. Robert
George Casella
1
+ PDF Chat Chernoff-type bound for finite Markov chains 1998 Pascal Lezaud
1
+ PDF Chat On the time taken by random walks on finite groups to visit every state 1983 David Aldous
1
+ Infinite clusters in percolation models 1981 Charles M. Newman
L. S. Schulman
1
+ The expected linearity of a simple equivalence algorithm 1978 Donald E. Knuth
Arnold Schönhage
1
+ PDF Chat Some Inequalities for Reversible Markov Chains 1982 David Aldous
1
+ PDF Chat Random walk on the infinite cluster of the percolation model 1993 Geoffrey Grimmett
Harry Kesten
Y. Zhang
1
+ PDF Chat The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model: A Unified Approach 1992 Florin Avram
Dimitris Bertsimas
1
+ PDF Chat Euclidean models of first-passage percolation 1997 C. Douglas Howard
Charles M. Newman
1
+ PDF Chat Markov Chains with Stochastically Stationary Transition Probabilities 1991 Steven Orey
1
+ On the stability of the behavior of random walks on groups 2000 Ch. Pittet
Laurent Saloff‐Coste
1
+ PDF Chat Geodesics in two-dimensional first-passage percolation 1996 Cristina Licea
Charles M. Newman
1
+ PDF Chat Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain 1953 David G. Kendall
1
+ What Do We Know about the Metropolis Algorithm ? 1998 Persi Diaconis
Laurent Saloff‐Coste
1
+ PDF Chat Estimating the Second Largest Eigenvalue of a Markov Transition Matrix 2000 Steven T. Garren
Richard L. Smith
1
+ PDF Chat Ergodic equivalence relations, cohomology, and von Neumann algebras 1975 Jacob J. Feldman
Calvin C. Moore
1
+ Monte Carlo Methods in Bayesian Computation 2000 Ming‐Hui Chen
Qi-Man Shao
Joseph G. Ibrahim
1
+ PDF Chat Ends in Uniform Spanning Forests 2008 Russell Lyons
Benjamin Morris
Oded Schramm
1
+ PDF Chat Growth and percolation on the uniform infinite planar triangulation 2003 Omer Angel
1
+ Automorphism groups of graphs as topological groups 1985 V. I. Trofimov
1
+ PDF Chat Amenable equivalence relations and Turing degrees 1991 Alexander S. Kechris
1
+ PDF Chat Average Stretch Factor: How Low Does It Go? 2015 Vida Dujmović
Pat Morin
Michiel Smid
1
+ PDF Chat Return Probabilities of a Simple Random Walk on Percolation Clusters 2005 Deborah Heicklen
Christopher Hoffman
1
+ PDF Chat Periodicity and Circle Packings of the Hyperbolic Plane 2003 Lewis Bowen
1
+ PDF Chat Random Walks and Percolation on Trees 1990 Russell Lyons
1
+ PDF Chat Random labelled trees and their branching networks 1980 Geoffrey Grimmett
1