The expected hitting times for graphs with cutpoints

Chen Haiyan and Zhang Fuji

Statistics & Probability Letters, 2004, vol. 66, issue 1, 9-17

Abstract: It is well known that the computation of the expected hitting times for random walks on graphs with cutpoints can be broken into smaller tasks. In this paper, using the electrical network approach, we provide the explicit formulas of the expected hitting times for simple random walks (SRW) on trees and unicyclic graphs. Furthermore, we obtain that the expected hitting times for SRW on trees are natural numbers.

Keywords: Random; walks; The; expected; hitting; time; Effective; resistance (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(03)00287-6
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:66:y:2004:i:1:p:9-17

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

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 ().