Skip to main content
SpringerLink
Log in

Decomposing Hitting Times of Walks on Graphs into Simpler Ones

  • Published:
Methodology and Computing in Applied Probability Aims and scope Submit manuscript

Abstract

Using the electric approach, we derive a formula that expresses an expected hitting time of a random walk between two vertices a and b of a graph G as a convex linear combination of expected hitting times of walks between a and b on subgraphs of G, provided certain condition on a and b is satisfied. Then we use this formula in several applications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Chandra AK, Raghavan P, Ruzzo WL, Smolensky R, Tiwari P (1989) The electrical resistance of a graph captures its commute and cover times, in proceedings of the twenty first annual ACM symposium on theory of computing. Seattle, Washington, pp 574–586

  • Doyle PG, Snell JL (1984) Random walks and electrical networks. The mathematical association of America. Washington

  • Grinstead CM, Snell JL (1997) Introduction to probability: Second revised edition. American Mathematical Society

  • Haiyan C, Fuji Z (2004) The expected hitting times for graphs with cutpoints. Statistics and Probability Letters 66:9–18

    Article  MathSciNet  MATH  Google Scholar 

  • Kirkland SJ, Neumann M (1999) Cutpoint decoupling and first passage times for random walks on graphs. SIAM J Matrix Anal Appl 20:860–870

    Article  MathSciNet  MATH  Google Scholar 

  • Palacios JL, Gómen E, Del Río M (2014) Hitting times of walks on graphs through voltages. Journal of Probability. Article ID 852481

  • Palacios JL (2009) On hitting times of random walks on trees. Statistics and Probability Letters 79:234–236

    Article  MathSciNet  MATH  Google Scholar 

  • Palacios JL, Renom JM (1998) Random walks on edge transitive graphs. Statistics and Probability Letters 37:29–34

    Article  MathSciNet  MATH  Google Scholar 

  • Pearce LH (1980) Random walks on trees. Discret Math 30:269–276

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad Simón Bolívar, Caracas, Venezuela

    Miguel Del Río

  2. Department of Electrical and Computing Engineering, University of New Mexico, Albuquerque, NM, 87131, USA

    José Luis Palacios

Authors
  1. Miguel Del Río
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Luis Palacios
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to José Luis Palacios.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Del Río, M., Palacios, J.L. Decomposing Hitting Times of Walks on Graphs into Simpler Ones. Methodol Comput Appl Probab 18, 1035–1042 (2016). https://doi.org/10.1007/s11009-015-9455-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11009-015-9455-6

Keywords

Mathematics Subject Classification (2010)

Search

Navigation