IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v130y2020i11p6863-6879.html
   My bibliography  Save this article

On the cover time of λ-biased walk on supercritical Galton–Watson trees

Author

Listed:
  • Bai, Tianyi

Abstract

In this paper, we study the time required for a λ-biased (λ>1) walk to visit all the vertices of a supercritical Galton–Watson tree up to generation n. Inspired by the extremal landscape approach in Cortines et al. (2018) for the simple random walk on binary trees, we establish the scaling limit of the cover time in the biased setting.

Suggested Citation

  • Bai, Tianyi, 2020. "On the cover time of λ-biased walk on supercritical Galton–Watson trees," Stochastic Processes and their Applications, Elsevier, vol. 130(11), pages 6863-6879.
    • Handle: RePEc:eee:spapps:v:130:y:2020:i:11:p:6863-6879
    DOI: 10.1016/j.spa.2020.07.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414920303124
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2020.07.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ding, Jian & Zeitouni, Ofer, 2012. "A sharp estimate for cover times on binary trees," Stochastic Processes and their Applications, Elsevier, vol. 122(5), pages 2117-2133.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jonathan Hermon, 2020. "A Spectral Characterization for Concentration of the Cover Time," Journal of Theoretical Probability, Springer, vol. 33(4), pages 2167-2184, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:130:y:2020:i:11:p:6863-6879. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.