Random walks on edge-transitive graphs (II)

We give formulas, in terms of the number of pure k-cycles, for the expected hitting times between vertices at distances greater than 1 for random walks on edge-transitive graphs, extending our prior results for neighboring vertices and also extending results of Devroye–Sbihi and Biggs concerning dis...

Full description

Saved in:
Bibliographic Details
Published in:Statistics & probability letters 1999-05, Vol.43 (1), p.25-32
Main Authors: Palacios, José Luis, Renom, José Miguel, Berrizbeitia, Pedro
Format: Article
Language:English
Subjects:
Cayley graphs
Edge-transitive graphs
Edge-transitive graphs Hitting times Cayley graphs
Exact sciences and technology
Hitting times
Markov processes
Mathematics
Probability and statistics
Probability theory and stochastic processes
Sciences and techniques of general use
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We give formulas, in terms of the number of pure k-cycles, for the expected hitting times between vertices at distances greater than 1 for random walks on edge-transitive graphs, extending our prior results for neighboring vertices and also extending results of Devroye–Sbihi and Biggs concerning distance-regular graphs. We apply these formulas to a class of Cayley graphs and give explicit values for the expected hitting times.
ISSN:0167-7152
1879-2103
DOI:10.1016/S0167-7152(98)00241-7