Lower bounds for covering times for reversible Markov chains and random walks on graphs (Q1825525)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4121162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for covering times for reversible Markov chains and random walks on graphs |
scientific article; zbMATH DE number 4121162 |
Statements
Lower bounds for covering times for reversible Markov chains and random walks on graphs (English)
0 references
1989
0 references
For simple random walk on an N-vertex graph the mean time to cover all vertices is at least cN log N where c is an absolute constant. This result is deduced from a more general result about a lower bound for the mean coverage time for stationary finite-state reversible Markov chains, starting with the stationary distribution.
0 references
graph covering
0 references
random walk
0 references
mean coverage time
0 references
reversible Markov chains
0 references
stationary distribution
0 references
0.8778620958328247
0 references
0.858899712562561
0 references
0.8547634482383728
0 references
0.8546590209007263
0 references
0.8489488959312439
0 references
