Abstract
The exact formula for the average hitting time (HT, as an abbreviation) of simple random walks from one vertex to any other vertex on the square CN2 of an N-vertex cycle graph CN was given by Chair (2014). In that paper, the author gives the expression for the even N case and the expression for the odd N case separately. In this paper, by using an elementary method different from Chair (2014), we give a much simpler single formula for the HT’s of simple random walks on CN2. Our proof is considerably short and fully combinatorial, in particular, has no-need of any spectral graph theoretical arguments. Not only the formula itself but also intermediate results through the process of our proof describe clear relations between the HT’s of simple random walks on CN2 and the Fibonacci numbers.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
