Decomposing Hitting Times of Walks on Graphs into Simpler Ones

作者：Del Rio Miguel; Palacios Jose Luis^*

来源：Methodology and Computing in Applied Probability, 2016, 18(4): 1035-1042.

DOI：10.1007/s11009-015-9455-6

• Effective resistance
• Voltage
• Unicyclic graphs

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.

• 出版日期2016-12