A Central Limit Theorem for the mean starting hitting time for a random walk on a random graph
Probability
2020-03-31 v1
Abstract
We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it takes the random walker on average to first hit a vertex when starting in a fixed vertex . The average is taken with respect to , the invariant measure of the random walk.
Cite
@article{arxiv.2003.13011,
title = {A Central Limit Theorem for the mean starting hitting time for a random walk on a random graph},
author = {Matthias Löwe and Sara Terveer},
journal= {arXiv preprint arXiv:2003.13011},
year = {2020}
}