Premium
A tight lower 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.3240060406
Subject(s) - cover (algebra) , random walk , random regular graph , combinatorics , mathematics , upper and lower bounds , graph , random graph , discrete mathematics , 1 planar graph , chordal graph , statistics , engineering , mathematical analysis , mechanical engineering
We prove that the expected time for a random walk to cover all n vertices of a graph is at least (1 + o (1)) n In n .
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