Random walks on edge transitive graphs

We find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending prior results and allowing the computation of sharp upper and lower bounds for the expected cover times of those graphs.

MoreLess

Year of publication:	1998
Authors:	Palacios, JoséLuis ; Renom, JoséMiguel
Published in:	Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 37.1998, 1, p. 29-34
Publisher:	Elsevier
Keywords:	Edge-transitive graphs Cover times Effective resistance

More details

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

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