Timeline for Simple random walk on the 3-1 tree is recurrent
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2012 at 2:16 | comment | added | Douglas Zare | Consider collapsing all vertices in level $n$ or below which are descendants of $v$ to a single new vertex $v_n$. As $n\to\infty$, the resistance between $v$ and $v_n$ goes to infinity. See chapter $2$ of math.dartmouth.edu/~doyle/docs/walks/walks.pdf . | |
| Aug 16, 2012 at 16:28 | comment | added | user25748 | Hi, Can you explain this: "the resistance in the downward direction is infinite" Thanks | |
| Jul 15, 2012 at 23:33 | history | edited | Douglas Zare | CC BY-SA 3.0 |
added "almost surely"
|
| Jul 15, 2012 at 14:53 | history | edited | Douglas Zare | CC BY-SA 3.0 |
added ceiling symbols
|
| Jul 15, 2012 at 14:41 | history | answered | Douglas Zare | CC BY-SA 3.0 |