On the average hitting times of weighted Cayley graphs
DOI:
https://doi.org/10.13069/jacodesmath.v14i1.358Keywords:
Random walk, Hitting time, Weighted graph, Cayley graph, Kirchhoff indexAbstract
In this paper, we give exact formulas for the average hitting times of random walks from one vertex to any other vertex on certain weighted Cayley graphs.
Received: 26 November 2024 | Revised: 31 May 2026 | Accepted: 09 July 2026
Downloads
References
A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and P. Tiwari, The electrical resistance of a graph captures its commute and cover times, Comput. Complexity 6 (1996) 312–340.
X. Chang, H. Xu, and S. T. Yau, Spanning trees and random walks on weighted graphs, Pacific J. Math. 273(1) (2015) 241–255.
H. Chen and F. Zhang, Resistance distance and the normalized laplacian spectrum, Discrete Appl. Math. 155(5) (2007) 654–661.
Y. Doi, N. Konno, T. Nakamigawa, T. Sakuma, E. Segawa, H. Shinohara, S. Tamura, Y. Tanaka, and K. Toyota, On the average hitting times of the squares of cycles, Discrete Appl. Math. 313 (2022) 18–28.
R. A. Horn and C. R. Johnson, Matrix Analysis, 2nd ed., Cambridge University Press, Cambridge (2012).
G. Kirchhoff, Uber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird, Ann. der Phys. 148(12) (1847) 497–508.
S. Klee and M. T. Stamps, Linear algebraic techniques for weighted spanning tree enumeration, Linear Algebra Appl. 582 (2019) 391–402.
D. J. Kleitman and B. Golden, Counting trees in a certain class of graphs, Amer. Math. Monthly 82(1) (1975) 40–44.
H. Mitsuhashi, H. Morita, and I. Sato, The weighted \keepcaseKirchhoff index of a graph, Linear Algebra Appl. 547 (2018) 1–18.
Y. Tanaka, On the average hitting times of Cay($\mathbb{Z}_N,{+1,+2}$), Discrete Appl. Math. 343 (2024) 269–276.
Q. Zhu and Y. Wang, The Kirchhoff index of weighted graphs, Int. J. Algebra 7(5--8) (2013) 267–280.
