Random walks on finite groups and rapidly mixing Markov chains
On countable dense random sets
Near-minimal spanning trees : a scaling exponent in probability models
We study the relation between the minimal spanning tree (MST) on many random points and the “near-minimal” tree which is optimal subject to the constraint that a proportion of its edges must be different from those of the MST. Heuristics suggest that, regardless of details of the probability model, the ratio of lengths should scale as 1+( ). We prove this in the model of the lattice with random edge-lengths and in the euclidean model.
Brownian excursion conditioned on its local time.
Stochastic coalescence.
A stochastic complex network model society.
How to combine fast heuristic Markov chain Monte Carlo with slow exact sampling.
Processes on unimodular random networks.
Page 1