Premium
A tight upper bound on the cover time for random walks on graphs
Author(s) -
Feige Uriel
Publication year - 1995
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.3240060106
Subject(s) - combinatorics , random walk , random regular graph , cover (algebra) , upper and lower bounds , mathematics , random graph , graph , discrete mathematics , 1 planar graph , chordal graph , statistics , engineering , mechanical engineering , mathematical analysis
We prove that the expected time for a random walk to visit all n vertices of a connected graph is at most 4/27 n 3 + o ( n 3 ).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom