Abstract
We consider a simple random walk on a connected undirected graph with N vertices. Palacios (2010) and Palacios and Renom (2012) investigated lower bounds on partial sums of expected hitting times of the random walk. In this paper, we show that Palacios’ (2010) lower bound is the best for all multigraphs. In addition, we show that the conjecture made by Palacios and Renom (2012) for simple graphs is true for N≤5, but it is not true for N≥6.
| Original language | English |
|---|---|
| Article number | 108715 |
| Journal | Statistics and Probability Letters |
| Volume | 160 |
| DOIs | |
| Publication status | Published - 2020 May |
Keywords
- Hitting times
- Random walks on graphs
ASJC Scopus subject areas
- Statistics and Probability
- Statistics, Probability and Uncertainty
Fingerprint Dive into the research topics of 'Lower bounds on partial sums of expected hitting times'. Together they form a unique fingerprint.
Cite this
Yoon, H., Kim, B., & Kim, J. (2020). Lower bounds on partial sums of expected hitting times. Statistics and Probability Letters, 160, [108715]. https://doi.org/10.1016/j.spl.2020.108715