Timeline for Reference Request: Cover time for simple random walk on $n \times n$ torus
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 19, 2017 at 20:02 | history | edited | Ben McKay | CC BY-SA 3.0 |
formatting
|
| Jan 19, 2017 at 19:18 | answer | added | Yuval Peres | timeline score: 1 | |
| Apr 17, 2012 at 23:15 | vote | accept | David White | ||
| Apr 17, 2012 at 17:50 | answer | added | Max | timeline score: 6 | |
| Apr 17, 2012 at 17:20 | comment | added | Gerhard Paseman | You might be able to capitalize on the return time for an infinite grid. If it is O(n^2), then a return to the origin from a given direction is also O(n^2), and now you can traverse the grid in V^2*O(n^2) steps. Gerhard "Ask Me About System Design" Paseman, 2012.04.17 | |
| Apr 17, 2012 at 17:11 | history | asked | David White | CC BY-SA 3.0 |