Advanced Search
MyIDEAS: Login to save this article or follow this journal

Random walks on trees and the law of iterated logarithm

Contents:

Author Info

  • Konsowa, Mokhtar H.
Registered author(s):

    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

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/B6V1D-44CXX5G-3/2/a7d7350c6e95bc1f56330eef68b4a1d0
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Statistics & Probability Letters.

    Volume (Year): 56 (2002)
    Issue (Month): 2 (January)
    Pages: 193-197

    as in new window
    Handle: RePEc:eee:stapro:v:56:y:2002:i:2:p:193-197

    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
    Web: https://shop.elsevier.com/order?id=505573&ref=505573_01_ooc_1&version=01

    Related research

    Keywords: Random walks Infinite trees Law of iterated logarithm;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Konsowa, Mokhtar H. & Oraby, Tamer F., 2003. "Dimensions of random trees," Statistics & Probability Letters, Elsevier, Elsevier, vol. 62(1), pages 49-60, March.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.