Percolation of coalescing random walks
Journal of Applied Probability1990Vol. 27(2), pp. 269–277
Citations Over TimeTop 22% of 1990 papers
Abstract
We study the shape of the binary tree containing 0 that is created from percolation of coalescing random walks. The key result is a duality lemma describing the shape of the tree. Furthermore, we show that and where A ( R 0 ), M ( R 0 ), L ( R 0 ) are respectively the area, the number of external nodes and the length of the longest path of the tree R 0 .
Related Papers
- → Reply to “Comment on ‘Semiquantum-key distribution using less than four quantum states’ ”(2011)23 cited
- → Building Corpus-based Frequency Lemma Lists(2015)3 cited
- → Short proofs for generalizations of the Lovász Local Lemma: Shearer's condition and cluster expansion(2017)1 cited
- → Random walk attracted by percolation clusters(2005)