On partial sums of hitting times

We conjecture that if Tj is the hitting time of vertex j then ∑jEiTj≥(N−1)2, for all i, for a random walk on any connected graph G=(V,E) with |E|=N. We prove the conjecture for a family of graphs containing the regular graphs and obtain slightly better bounds for trees and non-regular edge-transitive graphs.

MoreLess

Year of publication:	2012
Authors:	Palacios, José Luis ; Renom, José M.
Published in:	Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 82.2012, 4, p. 783-785
Publisher:	Elsevier
Subject:	Effective resistance \| Kirchhoff index

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011040051