On partial sums of hitting times

José Luis Palacios and José M. Renom

Statistics & Probability Letters, 2012, vol. 82, issue 4, 783-785

Abstract: 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.

Keywords: Effective resistance; Kirchhoff index (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715211003944
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:82:y:2012:i:4:p:783-785

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spl.2011.12.012

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().