Timeline for The probability a self-avoiding random walk (SAW) on a rectangular or hexagonal lattice takes more than $N$ steps before trapping itself
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 9, 2012 at 17:38 | vote | accept | CKura | ||
| Sep 7, 2012 at 21:31 | comment | added | Vincent Beffara | That's the thing, a self-avoiding is not something that "takes steps" ... It is a measure on the set of self-avoiding paths, so you can ask for e.g. the probability that it is boxed in at its extremity. We would like to have a decent object that is self-avoiding and is still dynamical and "makes moves", sure, but so far we don't ... | |
| Sep 7, 2012 at 8:23 | comment | added | CKura | @Vincent Beffara, sorry if I was confusing with my question formulation. My question wasn't "how long will the walk remain self-avoiding" but rather, if the walk is strictly self-avoiding, how many steps will the walk take before it "boxes itself in" and is no longer able to make any moves without revisiting a vertex. | |
| Sep 7, 2012 at 7:10 | history | answered | Vincent Beffara | CC BY-SA 3.0 |