Christopher Zhang
Published 2023-02-03Version 1
Using the results of Ding, Lee, Peres [3], we develop formulas to compute the hitting times and cover times for random walks on groups. We developed an explicit formula for hitting times in terms of the irreducible representations of the group. We also have a way of computing cover times in terms of these hitting times. This computation is based on a quantity we indentified, which we call the volume growth function. And we believe that it is the right object to study in order to understand the cover time.
Comments: This is old work from 2017 that I never intended to publish, but it has been on my website for a number of years. I'm adding it to arXiv at the request of others who would like to cite it. Unfortunately the original tex source code has been lost long ago, so I am not able to make any corrections to it. I apologize for any errors
The Hitting Times with Taboo for a Random Walk on an Integer Lattice
A local limit theorem for random walks in balanced environments
Hitting times for non-backtracking random walks
![QR code for arXiv:2302.01963 [math.PR]](http://oss.arxitics.com/images/favicon.svg)