Random walks on trees and the law of iterated logarithm

Mokhtar H. Konsowa

Statistics & Probability Letters, 2002, vol. 56, issue 2, 193-197

Abstract: In this paper we give an alternative proof for the main result of Konsowa and Mitro (J. Theor. Probab. 4 (3) (1991) 535), Konsowa and Mitro found that the simple random walk (SRW) on infinite trees is transient or recurrent. In part of their work, they considered the case of an -tree in which all the vertices of the same distance n from the root have the same degree which is 3 with probability qn and 2 with probability 1-qn. They proved that the SRW is transient if liminf nqn>1/log 2 and recurrent if limsup nqn

Keywords: Random; walks; Infinite; trees; Law; of; iterated; logarithm (search for similar items in EconPapers)
Date: 2002
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(01)00185-7
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:56:y:2002:i:2:p:193-197

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 ().