Answers are grounded in this paper and cite their sources.
For coalescing random walks driven by a chain with uniform stationary law, Aldous asked what conditions, beyond concentration of the mean meeting times of pairs from independent uniform starts, give a mean coalescence time asymptotic to twice the stationary mean meeting time τ. We study a weighted complete graph on m vertices joined to a two-vertex trap with scale r → ∞. The pair means concentrate exactly when r = o(m), and in every fixed L^p exactly when r = mᵒ⁽¹⁾. Then τ ~ m, while the coalescence time divided by 2mr tends to a mean-one exponential law in Wasserstein distance, with all moments. With r = log m the ratio of the mean coalescence time to 2τ grows like log m. Both stages of the plan Aldous proposed hold; the hand-off between them fails, because once few walkers remain, one of them sits in the trap. The worst-start mixing time is at least of order mr, much larger than τ.
No takes yet. Share an insight, caveat, or question.
Yitzchak Shmalo (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: