Timeline for Longest of random worm-like paths in $\mathbb{Z}^2$
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:56 | history | edited | CommunityBot |
replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/
|
|
| Jan 21, 2015 at 1:55 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Replaced \mod with \bmod.
|
| Jun 23, 2014 at 10:37 | vote | accept | Joseph O'Rourke | ||
| Jun 22, 2014 at 15:02 | answer | added | Douglas Zare | timeline score: 16 | |
| Jun 22, 2014 at 11:16 | comment | added | Joseph O'Rourke | @DouglasZare: I see the $\frac{1}{2}$ probability per step, but not its consequences. Could you expand upon your observations? Thanks! | |
| Jun 22, 2014 at 11:15 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Removed extra horiz rule.
|
| Jun 22, 2014 at 1:25 | comment | added | Douglas Zare | Each partial path extends in each direction with probability at most $1/2$ per step, so the length of the path through a tile is dominated by a sum of two geometric random variables. So, the longest path is $O(\log n)$ with high probability. A lower bound of the same form follows from choosing the path ahead of time. | |
| Jun 22, 2014 at 0:05 | history | asked | Joseph O'Rourke | CC BY-SA 3.0 |