IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v37y1998i1p29-34.html
   My bibliography  Save this article

Random walks on edge transitive graphs

Author

Listed:
  • Palacios, JoséLuis
  • Renom, JoséMiguel

Abstract

We find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending prior results and allowing the computation of sharp upper and lower bounds for the expected cover times of those graphs.

Suggested Citation

  • Palacios, JoséLuis & Renom, JoséMiguel, 1998. "Random walks on edge transitive graphs," Statistics & Probability Letters, Elsevier, vol. 37(1), pages 29-34, January.
    • Handle: RePEc:eee:stapro:v:37:y:1998:i:1:p:29-34
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(97)00095-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Palacios, José Luis & Renom, José M., 2012. "On partial sums of hitting times," Statistics & Probability Letters, Elsevier, vol. 82(4), pages 783-785.
    2. González-Arévalo, Bárbara & Palacios, José Luis, 1999. "Expected hitting times for random walks on weak products of graphs," Statistics & Probability Letters, Elsevier, vol. 43(1), pages 33-39, May.
    3. 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.
    4. Haiyan, Chen & Fuji, Zhang, 2004. "The expected hitting times for graphs with cutpoints," Statistics & Probability Letters, Elsevier, vol. 66(1), pages 9-17, January.
    5. S. Madhumitha & Sudev Naduvath, 2023. "Graphs Defined on Rings: A Review," Mathematics, MDPI, vol. 11(17), pages 1-80, August.
    6. Palacios, José Luis & Renom, José Miguel & Berrizbeitia, Pedro, 1999. "Random walks on edge-transitive graphs (II)," Statistics & Probability Letters, Elsevier, vol. 43(1), pages 25-32, May.

    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. 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.
    5. 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.
    6. 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).
    7. 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).
    8. 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.
    9. 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).
    10. 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.

    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:stapro:v:37:y:1998:i:1:p:29-34. 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/622892/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.