Random walks on trees and the law of iterated logarithm
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
Volume (Year): 56 (2002)
Issue (Month): 2 (January)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:56:y:2002:i:2:p:193-197. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.