Random walks on graphs: new bounds on hitting, meeting, coalescing and returning

ANALCO, Volume abs/1807.06858, 2019, Pages 119-126.

Cited by: 1|Bibtex|Views11
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a discrete-time version of the first-named author's ``Meeting time lemma"~ that bounds the probability o...More

Code:

Data:

Your rating :
0

 

Tags
Comments