Article contents
Percolation of coalescing random walks
Published online by Cambridge University Press: 14 July 2016
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(R0), M(R0), L(R0) are respectively the area, the number of external nodes and the length of the longest path of the tree R0.
Keywords
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1990
References
- 4
- Cited by