Expected hitting times for random walks on quadrilateral graphs and their applications

References

• Klein DJ , Randić M . Resistance distance. J Math Chem. 1993;12:81–95.
   Web of Science ®Google Scholar
• Koolen JK , Markowsky G . A collection of results concerning electric resistance and simple random walk on distance-regular graphs. Discrete Math. 2016;339(2):737–744.
   Web of Science ®Google Scholar
• Somodi M . On the Ihara zeta function and resistance distance-based indices. Linear Algebra Appl. 2017;513:201–209.
   Web of Science ®Google Scholar
• Chen HY , Zhang FJ . Resistance distance and the normalized Laplacian spectrum. Discrete Appl Math. 2007;155:654–661.
   Web of Science ®Google Scholar
• Feng LH , Gutman I , Yu GH . Degree Kirchhoff index of unicyclic Graphs. MATCH Commun Math Comput Chem. 2013;69:629–648.
   Web of Science ®Google Scholar
• Chung FRK . Spectral graph theory. Providence (RI): American Mathematical Society; 1997.
   Google Scholar
• Huang J , Li SC . On the normalised Laplacian spectrum degree-Kirchhoff index and spanning trees of graphs. Bull Aust Math Sco. 2015;91:353–367.
   Web of Science ®Google Scholar
• Huang J , Li SC , Sun LQ . The normalized Laplacians degree-Kirchhoff index and the spanning trees of linear hexagonal chains. Discrete Appl Math. 2016;207:67–79.
   Web of Science ®Google Scholar
• Huang J , Li SC , Li XC . The normalized Laplacian degree-Kirchhoff index and spanning trees of the linear polyomino chains. Appl Math Comput. 2016;289:324–334.
   Web of Science ®Google Scholar
• Liu Y , Shen J . The (normalized) Laplacian eigenvalue of signed graphs. Taiwan J Math. 2015;19(2):505–517.
   Web of Science ®Google Scholar
• Aldous DJ . Reversible Markov chains and random walks on graphs. Berkeley (CA): University of California; 1993.
   Google Scholar
• Kemeny JG , Snell JL . Finite Markov chains. Princeton (NJ): Van Nostrand; 1960.
   Google Scholar
• Lovász L . Random walks on graphs: a survey, in combinatorics. Paul Erdős is Eighty, Bolyai Soc Math Stud. 1993;2(1):1–46.
   Google Scholar
• Bartal Y , Chrobak M , Noga J , et al . More on random walks, electrical networks, and the harmonic k-server algorithm. Inform Process Lett. 2002;84:271–276.
   Web of Science ®Google Scholar
• Chandra AK , Raghavan P , Ruzzo WL , et al . The electrical resistance of a graph captures its commute and cover times. Comput Complex. 1996;6:312–340.
   Web of Science ®Google Scholar
• Nash-Williams CJA . Random walk and electric currents in networks. Proc Cambridge Philos Soc. 1959;55:181–194.
   Google Scholar
• Tetali P . Random walks and effective resistance of networks. J Theoret Probab. 1991;4:101–109.
   Google Scholar
• Aldous DJ . Hitting times for random walks on vertex-transitive graphs. Math Proc Cambridge Philos Soc. 1989;106:179–191.
   Web of Science ®Google Scholar
• Chen HY , Zhang FJ . The expected hitting times for graphs with cutpoints. Statist Probab Lett. 2004;66:9–17.
   Web of Science ®Google Scholar
• Palacios JL . Expected hitting and cover Times of random walks on some special graphs. Random Struct Algebra. 1994;5:173–182.
   Web of Science ®Google Scholar
• Palacios JL , Tetali P . A note on expected hitting times for birth and death chains. Stat Probab Lett. 1996;30:119–125.
   Web of Science ®Google Scholar
• van Slijpe ARD . Random walks on the triangular prism and other vertex-transitive graphs. J Comput Appl Math. 1986;15:383–394.
   Web of Science ®Google Scholar
• Georgakopoulos A , Wagner S . Hitting times, cover cost, and the Wiener index of a tree. J Graph Theory. 2017;84(3):311–326.
   Web of Science ®Google Scholar
• Chang X , Xu H . Chung-Yau invariants and graphs with symmetric hitting times. J Graph Theory. 2017;85:691–705.
   Web of Science ®Google Scholar
• Chang X , Xu H , Yau S-T . Spanning trees and random walks on weighted graphs. Pacific J Math. 2015;273:241–255.
   Web of Science ®Google Scholar
• Chen HY , Zhang FJ . The expected hitting times for finite Markov chains. Linear Algebra Appl. 2008;428:2730–2749.
   Web of Science ®Google Scholar
• Cogill R , Peng C . A spanning tree method for bounding hitting times of random walks on graphs. SIAM J Discrete Math. 2010;24:808–820.
   Web of Science ®Google Scholar
• Del Río M , Palacios JL . Decomposing hitting times of walks on graphs into simpler ones. Method Comput Appl Probab. 2016;18(4):1035–1042.
   Web of Science ®Google Scholar
• Ikeda S , Kubo I , Yamashita M . The hitting and cover times of random walks on finite graphs using local degree information. Theoret Comput Sci. 2009;410:94–100.
   Web of Science ®Google Scholar
• Lawler GF . Expected hitting times for a random walk on a connected graph. Discrete Math. 1986;61:85–92.
   Web of Science ®Google Scholar
• Palacios JL . Bounds on expected hitting times for random walk on a connected graph. Linear Algebra Appl. 1990;141:241–252.
   Web of Science ®Google Scholar
• Patel R , Carron A , Bullo F . The hitting time of multiple random walks. SIAM J Matrix Anal Appl. 2016;37(3):933–954.
   Web of Science ®Google Scholar
• Xu H , Yau S-T . Discrete Green’s functions and random walks on graphs. J Combin Theory Ser A. 2013;120:483–499.
   Web of Science ®Google Scholar
• Hunter JJ . The role of Kemeny’s constant in properties of Markov chains. Commun Statist Theor Meth. 2014;43:1309–1321.
   Web of Science ®Google Scholar
• Chen HY . Hitting times for random walks on subdivision and triangulation graphs. Linear Multilinear Algebra. 2017; DOI:10.1080/03081087.2017.1287159
   Web of Science ®Google Scholar
• Li DQ , Hou YP . The normalized Laplacian spectrum of quadrilateral graphs and its applications. Appl Math Comput. 2017;297:180–188.
   Web of Science ®Google Scholar
• Cvetkovič D , Rowlinson P , Simić S . An Introduction to the theory of graph spectra London mathematical society student texts. London: Cambridge University; 2010.
   Google Scholar
• Bapat RB . Graphs and matrices. London: Springer; 2010.
   Google Scholar
• Butler S . Algebraic aspects of the normalized Laplacian IMA volumes in mathematics and its applications. Vol. 159. Springer; 2016. p. 295–315.
   Google Scholar
• Chandra AK , Raghavan P , Ruzzo WL , et al. Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, Washington. 1989. p. 574–586
   Google Scholar