Random walks on edge-transitive graphs (II)

José Luis Palacios; José Miguel Renom; Pedro Berrizbeitia

doi:10.1016/s0167-7152(98)00241-7

Random walks on edge-transitive graphs (II)

José Luis Palacios, José Miguel Renom, Pedro Berrizbeitia

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	25-32
Number of pages	8
Journal	Statistics and Probability Letters
Volume	43
Issue number	1
DOIs	https://doi.org/10.1016/s0167-7152(98)00241-7
State	Published - 15 May 1999
Externally published	Yes

Keywords

Cayley graphs
Edge-transitive graphs
Hitting times

Access to Document

10.1016/s0167-7152(98)00241-7

Cite this

@article{b11f85b0a3f54c20b7f4b52e201f3702,

title = "Random walks on edge-transitive graphs (II)",

abstract = "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.",

keywords = "Cayley graphs, Edge-transitive graphs, Hitting times",

author = "Palacios, \{Jos{\'e} Luis\} and Renom, \{Jos{\'e} Miguel\} and Pedro Berrizbeitia",

year = "1999",

month = may,

day = "15",

doi = "10.1016/s0167-7152(98)00241-7",

language = "English",

volume = "43",

pages = "25--32",

journal = "Statistics and Probability Letters",

issn = "0167-7152",

number = "1",

}

TY - JOUR

T1 - Random walks on edge-transitive graphs (II)

AU - Palacios, José Luis

AU - Renom, José Miguel

AU - Berrizbeitia, Pedro

PY - 1999/5/15

Y1 - 1999/5/15

N2 - 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.

AB - 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.

KW - Cayley graphs

KW - Edge-transitive graphs

KW - Hitting times

UR - https://www.scopus.com/pages/publications/0041876527

U2 - 10.1016/s0167-7152(98)00241-7

DO - 10.1016/s0167-7152(98)00241-7

M3 - Article

AN - SCOPUS:0041876527

SN - 0167-7152

VL - 43

SP - 25

EP - 32

JO - Statistics and Probability Letters

JF - Statistics and Probability Letters

IS - 1

ER -

Random walks on edge-transitive graphs (II)

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this