Timeline for Random walk on a two-dimensional uniform grid
Current License: CC BY-SA 2.5
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 13, 2010 at 12:10 | vote | accept | Seb67 | ||
Sep 13, 2010 at 12:10 | |||||
Sep 13, 2010 at 11:14 | comment | added | alext87 | We can give exact expressions for the probability of crossing at $(i,i)$. | |
Sep 13, 2010 at 11:10 | comment | added | alext87 | Yep I was confused about crossing so I took it as meeting it. Seb67 did you mean Robin's interpretation? | |
Sep 13, 2010 at 11:09 | comment | added | Seb67 | Yes I am sorry for being sloppy in my definitions. I felt that the precise definition of "crossing" did not really matter since anyway we won't have have an exact formula but rather some bounds (which would probably be true for both definitions of crossing that you give, at least when $n$ is very large). | |
Sep 13, 2010 at 11:08 | history | edited | alext87 | CC BY-SA 2.5 |
added 463 characters in body
|
Sep 13, 2010 at 11:02 | comment | added | Robin Chapman | I suspect Seb67 may assume that the "main diagonal" goes from $(0,0)$ to $(n,n)$. That's how I would interpret it. I'm not sure what "cross" means either: maybe three consecutive points $P_1$, $P_2$, $P_3$ with $P_2$ on the diagonal and $P_1$ and $P_3$ on opposite sides, or maybe just with $P_2$ on the diagonal. | |
Sep 13, 2010 at 11:01 | comment | added | Seb67 | I am very sorry that I did not define the "main diagonal", to me it is the one going from $(0,0)$ to $(n,n)$. | |
Sep 13, 2010 at 10:54 | history | answered | alext87 | CC BY-SA 2.5 |