On the speed of random walks on random trees

Mokhtar H. Konsowa

Statistics & Probability Letters, 2009, vol. 79, issue 20, 2230-2236

Abstract: The speed of a random walk on a graph depends on the structure of that graph. We consider the simple random walks on infinite leafless trees, where the speed is closely related to the branching rate in such a way that the more the branching of the tree the more likely the speed is positive. We determine the speed of simple random walks on some random trees.

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(09)00275-2
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:79:y:2009:i:20:p:2230-2236

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().