The following pages link to David Aldous (Q212984):
Displaying 50 items.
- A conversation with Jim Pitman (Q1630402) (← links)
- Random partitions of the plane via Poissonian coloring and a self-similar process of coalescing planar partitions (Q1660625) (← links)
- Elo ratings and the sports model: a neglected topic in applied probability? (Q1704712) (← links)
- A framework for imperfectly observed networks (Q1756569) (← links)
- Brownian bridge asymptotics for random \(p\)-mappings (Q1767515) (← links)
- The harmonic mean formula for probabilities of unions: Applications to sparse random graphs (Q1823263) (← links)
- An introduction to covering problems for random walks on graphs (Q1825524) (← links)
- Lower bounds for covering times for reversible Markov chains and random walks on graphs (Q1825525) (← links)
- Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent (Q1840520) (← links)
- The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity (Q1881632) (← links)
- A Markovian extension of Valiant's learning model (Q1892872) (← links)
- Hammersley's interacting particle process and longest increasing subsequences (Q1900235) (← links)
- Mixing times for uniformly ergodic Markov chains (Q1965874) (← links)
- Route lengths in invariant spatial tree networks (Q2064832) (← links)
- To stay discovered: on tournament mean score sequences and the Bradley-Terry model (Q2145803) (← links)
- Errata to: ``Processes on unimodular random networks'' (Q2362558) (← links)
- The continuum random tree. III (Q2365746) (← links)
- Optimal flow through the disordered lattice (Q2371944) (← links)
- Processes on unimodular random networks (Q2462018) (← links)
- Tree-based models for random distribution of mass (Q2499950) (← links)
- The compulsive gambler process (Q2515901) (← links)
- Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees (Q2570830) (← links)
- Second errata to: ``Processes on unimodular random networks'' (Q2631851) (← links)
- Scale-invariant random spatial networks (Q2637759) (← links)
- Threshold limits for cover times (Q2638665) (← links)
- A real-world Markov chain arising in recreational volleyball (Q2668137) (← links)
- The \(\zeta(2)\) limit in the random assignment problem (Q2746215) (← links)
- On the stability of a batch clearing system with Poisson arrivals and subadditive service times (Q2774440) (← links)
- Weak concentration for first passage percolation times on graphs and general increasing set-valued processes (Q2829201) (← links)
- When Knowing Early Matters: Gossip, Percolation and Nash Equilibria (Q2838132) (← links)
- Using Prediction Market Data to Illustrate Undergraduate Probability (Q2856458) (← links)
- Book review of: G. Grimmett, Probability on graphs. Random processes on graphs and lattices (Q2864929) (← links)
- Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels (Q3030711) (← links)
- Edge flows in the complete random-lengths network (Q3055894) (← links)
- More Uses of Exchangeability: Representations of Complex Random Structures (Q3077983) (← links)
- (Q3096558) (← links)
- Reorganizing Large Web Sites (Q3146535) (← links)
- Cost–Volume Relationship for Flows Through a Disordered Network (Q3168994) (← links)
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees (Q3204479) (← links)
- A Tractable Complex Network Model based on the Stochastic Mean-field Model of Distance (Q3370773) (← links)
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing (Q3415826) (← links)
- Hashing with Linear Probing under Nonuniform Probabilities (Q3415863) (← links)
- Two Applications of Urn Processes The Fringe Analysis of Search Trees and The Simulation of Quasi-Stationary Distributions of Markov Chains (Q3415892) (← links)
- Spatial transportation networks with transfer costs: asymptotic optimality of hub-and-spoke models (Q3524096) (← links)
- Dynamic Programming Optimization over Random Data: The Scaling Exponent for Near-Optimal Solutions (Q3654380) (← links)
- (Q3660628) (← links)
- (Q3675249) (← links)
- Self-intersections of random walks on discrete groups (Q3681675) (← links)
- Limit theorems for subsequences of arbitrarily-dependent sequences of random variables (Q3687419) (← links)
- Shuffling Cards and Stopping Times (Q3739943) (← links)
