Abstract
We define directed rooted labeled and unlabeled trees and find measures on the space of directed rooted unlabeled trees which are invariant with respect to transition probabilities corresponding to a biased random walk on a directed rooted labeled tree. We use these to calculate the speed of a biased random walk on directed rooted labeled trees. The results are mainly applied to directed trees with recurrent subtrees, where the random walker cannot escape.
| Original language | English |
|---|---|
| Pages (from-to) | 123-139 |
| Number of pages | 17 |
| Journal | Probability Theory and Related Fields |
| Volume | 111 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - May 1998 |
Fields of science
- 101024 Probability theory