Decomposing Hitting Times of Walks on Graphs into Simpler Ones

Miguel Río and José Luis Palacios ()
Additional contact information
Miguel Río: Universidad Simón Bolívar
José Luis Palacios: University of New Mexico

Methodology and Computing in Applied Probability, 2016, vol. 18, issue 4, 1035-1042

Abstract: 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.

Keywords: Effective resistance; Voltage; Unicyclic graphs; Primary 05C81; Secondary 60J10 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s11009-015-9455-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:18:y:2016:i:4:d:10.1007_s11009-015-9455-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1007/s11009-015-9455-6

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().