Random walks with the minimum degree local rule have \(O(N^2)\) cover time (Q4575866)
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 6904148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random walks with the minimum degree local rule have \(O(N^2)\) cover time |
scientific article; zbMATH DE number 6904148 |
Statements
Random Walks with the Minimum Degree Local Rule Have <i>O</i>(<i>N</i><sup>2</sup>) Cover Time (English)
0 references
16 July 2018
0 references
0.9972487688064576
0 references
0.8285833597183228
0 references
0.8182714581489563
0 references
0.8105319142341614
0 references
0.8052258491516113
0 references
