Random walks on edge transitive graphs

José Luis Palacios; José Miguel Renom

doi:10.1016/s0167-7152(97)00095-3

Random walks on edge transitive graphs

José Luis Palacios, José Miguel Renom

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

13 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	29-34
Number of pages	6
Journal	Statistics and Probability Letters
Volume	37
Issue number	1
DOIs	https://doi.org/10.1016/s0167-7152(97)00095-3
State	Published - 15 Jan 1998
Externally published	Yes

Keywords

Cover times
Edge-transitive graphs
Effective resistance

Access to Document

10.1016/s0167-7152(97)00095-3

Cite this

@article{a2fa2f9fc255469e98f8eac2bd4064e4,

title = "Random walks on edge transitive graphs",

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

keywords = "Cover times, Edge-transitive graphs, Effective resistance",

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

year = "1998",

month = jan,

day = "15",

doi = "10.1016/s0167-7152(97)00095-3",

language = "English",

volume = "37",

pages = "29--34",

journal = "Statistics and Probability Letters",

issn = "0167-7152",

number = "1",

}

TY - JOUR

T1 - Random walks on edge transitive graphs

AU - Palacios, José Luis

AU - Renom, José Miguel

PY - 1998/1/15

Y1 - 1998/1/15

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

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

KW - Cover times

KW - Edge-transitive graphs

KW - Effective resistance

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

U2 - 10.1016/s0167-7152(97)00095-3

DO - 10.1016/s0167-7152(97)00095-3

M3 - Article

AN - SCOPUS:0032518003

SN - 0167-7152

VL - 37

SP - 29

EP - 34

JO - Statistics and Probability Letters

JF - Statistics and Probability Letters

IS - 1

ER -

Random walks on edge transitive graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this