IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v427y2022ics0096300322002478.html
   My bibliography  Save this article

The access time of random walks on trees with given partition

Author

Listed:
  • Feng, Lihua
  • Liu, Weijun
  • Lu, Lu
  • Wang, Wei
  • Yu, Guihai

Abstract

Denote by T(s,t) the set of trees, whose vertex set can be partitioned into two independent sets of sizes s and t respectively. Given a tree T with stationary distribution π and a vertex v∈T, the access time HT(π,v) is the expected length of optimal stopping rules from π to v. In this paper, we get a sharp upper bound for maxv∈THT(π,v) and a sharp lower bound for minv∈THT(π,v) among T(s,t), respectively. The corresponding extremal graphs are also obtained. As a byproduct, it is proved that the path Pn maximizes maxv∈THT(π,v) and the star K1,n−1 minimizes minv∈THT(π,v) among all trees on n vertices.

Suggested Citation

  • Feng, Lihua & Liu, Weijun & Lu, Lu & Wang, Wei & Yu, Guihai, 2022. "The access time of random walks on trees with given partition," Applied Mathematics and Computation, Elsevier, vol. 427(C).
    • Handle: RePEc:eee:apmaco:v:427:y:2022:i:c:s0096300322002478
    DOI: 10.1016/j.amc.2022.127173
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322002478
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127173?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. Göbel, F. & Jagers, A. A., 1974. "Random walks on graphs," Stochastic Processes and their Applications, Elsevier, vol. 2(4), pages 311-336, October.
    2. Palacios, José Luis, 2009. "On hitting times of random walks on trees," Statistics & Probability Letters, Elsevier, vol. 79(2), pages 234-236, January.
    3. José Luis Palacios, 2009. "On the Moments of Hitting Times for Random Walks on Trees," Journal of Probability and Statistics, Hindawi, vol. 2009, pages 1-4, October.
    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. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    2. Diala Wehbe & Nicolas Wicker, 2022. "Convergence Details About k-DPP Monte-Carlo Sampling for Large Graphs," Sankhya B: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 84(1), pages 188-203, May.
    3. Kivimäki, Ilkka & Shimbo, Masashi & Saerens, Marco, 2014. "Developments in the theory of randomized shortest paths with a comparison of graph node distances," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 600-616.
    4. José Luis Palacios & Daniel Quiroz, 2016. "Birth and Death Chains on Finite Trees: Computing their Stationary Distribution and Hitting Times," Methodology and Computing in Applied Probability, Springer, vol. 18(2), pages 487-498, June.
    5. Kiyoshi Inoue & Sigeo Aki & Balakrishnan Narayanaswamy, 2013. "Generating Functions of Waiting Times and Numbers of Visits for Random Walks on Graphs," Methodology and Computing in Applied Probability, Springer, vol. 15(2), pages 349-362, June.
    6. Miguel Río & José Luis Palacios, 2016. "Decomposing Hitting Times of Walks on Graphs into Simpler Ones," Methodology and Computing in Applied Probability, Springer, vol. 18(4), pages 1035-1042, December.
    7. Guo, Wei-Feng & Zhang, Shao-Wu, 2016. "A general method of community detection by identifying community centers with affinity propagation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 447(C), pages 508-519.
    8. Palacios, JoséLuis & Renom, JoséMiguel, 1998. "Random walks on edge transitive graphs," Statistics & Probability Letters, Elsevier, vol. 37(1), pages 29-34, January.
    9. Silver, Grant & Akbarzadeh, Meisam & Estrada, Ernesto, 2018. "Tuned communicability metrics in networks. The case of alternative routes for urban traffic," Chaos, Solitons & Fractals, Elsevier, vol. 116(C), pages 402-413.
    10. Kumar, Ajay & Singh, Shashank Sheshar & Singh, Kuldeep & Biswas, Bhaskar, 2020. "Link prediction techniques, applications, and performance: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    11. Ranjan, Gyan & Zhang, Zhi-Li, 2013. "Geometry of complex networks and topological centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(17), pages 3833-3845.
    12. Mueller, Falko, 2023. "Link and edge weight prediction in air transport networks — An RNN approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 613(C).
    13. Pei, Panpan & Liu, Bo & Jiao, Licheng, 2017. "Link prediction in complex networks based on an information allocation index," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 470(C), pages 1-11.

    More about this item

    Keywords

    Tree; Random walk; Stopping rule;
    All these keywords.

    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:apmaco:v:427:y:2022:i:c:s0096300322002478. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.