A conversation with David J. Aldous

DOI10.1214/22-STS849OpenAlexW4306158361WikidataQ126050341 ScholiaQ126050341MaRDI QIDQ2092903

Shankar Bhamidi

Publication date: 4 November 2022

Published in: Statistical Science (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/journals/statistical-science/volume-37/issue-4/A-Conversation-with-David-J-Aldous/10.1214/22-STS849.full

zbMATH Keywords

random graphsexchangeabilitynetwork modelsscaling limitslocal weak convergenceMarkov chain mixing times

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Another conversation with Persi Diaconis
• The incipient giant component in bond percolation on general finite weighted graphs
• The continuum random tree. I
• École d'été de probabilités de Saint-Flour XIII - 1983
• Limits of dense graph sequences
• Connected spatial networks over random points and a route-length statistic
• Strong uniform times and finite random walks
• Arbitrage and equilibrium in economies with infinitely many commodities
• Representations for partially exchangeable arrays of random variables
• Probability approximations via the Poisson clumping heuristic
• Trailing the dovetail shuffle to its lair
• Asymptotics in the random assignment problem
• Stopping times and tightness
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• The standard additive coalescent
• The uniform random tree in a Brownian excursion
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The entrance boundary of the multiplicative coalescent
• Morphogenesis of spatial networks
• Hammersley's interacting particle process and longest increasing subsequences
• The continuum random tree. III
• Processes on unimodular random networks
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Weak convergence of random p-mappings and the exploration process of inhomogeneous continuum random trees
• The ?(2) limit in the random assignment problem
• Weak Concentration for First Passage Percolation Times on Graphs and General Increasing Set-valued Processes
• Using Prediction Market Data to Illustrate Undergraduate Probability
• Selected Works of Oded Schramm
• Edge flows in the complete random-lengths network
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• A Tractable Complex Network Model based on the Stochastic Mean-field Model of Distance
• Graph limits and exchangeable random graphs
• Limit theorems for subsequences of arbitrarily-dependent sequences of random variables
• Shuffling Cards and Stopping Times
• Some matrix-variate distribution theory: Notational considerations and a Bayesian application
• Subspaces of L 1 , via Random Measures
• Generating a random permutation with random transpositions
• On the distribution of the length of the longest increasing subsequence of random permutations
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• A Prediction Tournament Paradox
• True scale-invariant random spatial networks
• The birth of the giant component
• Short-length routes in low-cost networks via Poisson line patterns
• A critical branching process model for biodiversity
• The Existence of Certain Stopping Times on Brownian Motion