Timeline for Meeting time lower bound for a random walks on a large finite graph of bounded degree
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 8, 2021 at 3:48 | comment | added | Yuval Peres | Indeed it is surprising, since if you start at the middle of the path the answer is linear in n. | |
| Mar 7, 2021 at 6:12 | comment | added | Ron P | Toda, Yuval. It is surprising! Is there any non-constant lower bound? | |
| Mar 4, 2021 at 6:51 | history | answered | Yuval Peres | CC BY-SA 4.0 |