Timeline for $n$-th return of a random walk on $\Bbb Z^d$
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jun 25, 2013 at 16:53 | history | suggested | Davide Giraudo | CC BY-SA 3.0 |
improved formatting.
|
| Jun 25, 2013 at 16:42 | review | Suggested edits | |||
| S Jun 25, 2013 at 16:53 | |||||
| Mar 28, 2012 at 19:48 | comment | added | sqz | yes thats one way to make a walk recurrent, but the fact that im on $\mathbb{Z}^d$ is pretty irrelevant to the main question | |
| Mar 28, 2012 at 15:13 | comment | added | Felipe Olmos | Ok, I haven't got that. So the transition probabilities are different in each site of $\mathbb{Z}^d$? | |
| Mar 28, 2012 at 1:00 | comment | added | sqz | you are thinking of the simple symmetric random walk, im only talking about a general random walk, which can be made recurrent in any dimension | |
| Mar 27, 2012 at 23:19 | comment | added | Felipe Olmos | The random walk is transient for $d \geq 3$, so your question makes sense only for $d=1,2$ i.e. $\sum_n f_n < 1$ in those cases | |
| Mar 27, 2012 at 22:18 | history | asked | sqz | CC BY-SA 3.0 |