Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time (Q3176187)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time |
scientific article |
Statements
Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time (English)
0 references
19 July 2018
0 references
reversible Markov chain
0 references
locally biased random walk
0 references
minimum weight spanning tree
0 references
cyclic cover time
0 references
0 references
0 references
