Timeline for Local time for conditioned simple random walk
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 28, 2016 at 7:54 | comment | added | Anthony Quas | Probably a more grown up way to say the same thing is to first fix $K$ and then choose a really large $M$ so that the conditioned random walk on $[M-2K,M]$ is so close to a simple symmetric random walk that it is very unlikely to do anything different within $K^2$ steps. Now the ssrw starting at $M-K$ visits that site $K$ times before hitting $M-2K$ or $M$. So the constant $C$ should exceed $K$ for an arbitrary $K$. | |
| Dec 27, 2016 at 23:33 | history | answered | Anthony Quas | CC BY-SA 3.0 |