Timeline for Combinatorics of lattice walks with forbidden points
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 15, 2010 at 21:03 | vote | accept | Jason Reed | ||
| Mar 15, 2010 at 21:10 | |||||
| Mar 15, 2010 at 18:18 | comment | added | Douglas Zare | By the way, it seems like it should be known how likely it is that a random walk will visit $(x,y)$ before it visits $(x_f,y_f)$. | |
| Mar 15, 2010 at 8:04 | comment | added | Douglas Zare | Yes, that's close to the second-to-last displayed equation, but I'd still need to relate $p_n$ and $q_n$. | |
| Mar 15, 2010 at 7:41 | comment | added | Robin Chapman | Can't you get this slightly quicker by splitting into two pieces: from $(0,0)$ to the first visit to $(x_f,y_f)$, and a general path from $(x_f,y_f)$ to $(x,y)$ ? | |
| Mar 15, 2010 at 7:28 | history | answered | Douglas Zare | CC BY-SA 2.5 |