Summary.
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.
Author information
Authors and Affiliations
Additional information
Received: 12 March 1997/ In revised form: 11 December 1997
Rights and permissions
About this article
Cite this article
Takacs, C. Biased random walks on directed trees. Probab Theory Relat Fields 111, 123–139 (1998). https://doi.org/10.1007/s004400050164
Issue Date:
DOI: https://doi.org/10.1007/s004400050164
- Mathematics Subject Classification (1991): Primary 60J15; Secondary 60J45.