Timeline for A discrete random walk that avoids previously visited vertices for an exponentially distributed time interval
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 16, 2012 at 10:01 | answer | added | Vincent Beffara | timeline score: 8 | |
| Sep 15, 2012 at 18:27 | answer | added | Joseph O'Rourke | timeline score: 2 | |
| Sep 15, 2012 at 16:28 | history | edited | T.R. | CC BY-SA 3.0 |
added 503 characters in body; Post Made Community Wiki
|
| Sep 15, 2012 at 16:01 | history | edited | T.R. | CC BY-SA 3.0 |
added 3 characters in body
|
| Sep 15, 2012 at 15:47 | comment | added | T.R. | @Stephen Shea Good point, I've edited the question to say that I would be open to $X$ adopting a different probability distribution. | |
| Sep 15, 2012 at 15:44 | history | edited | T.R. | CC BY-SA 3.0 |
deleted 98 characters in body
|
| Sep 15, 2012 at 11:59 | comment | added | Stephen Shea | On the note: Doesn't blocking visited vertices for a fixed positive time in 1-d imply that the walker never visits the same vertex twice? The more general question seems to be related to the theory of reinforced random walks (or even once reinforced random walks). There may be methods in that literature that would be useful to you. | |
| Sep 15, 2012 at 11:16 | history | edited | T.R. | CC BY-SA 3.0 |
added 302 characters in body
|
| Sep 15, 2012 at 10:08 | history | edited | T.R. | CC BY-SA 3.0 |
added 135 characters in body
|
| Sep 15, 2012 at 9:59 | history | edited | T.R. | CC BY-SA 3.0 |
added 140 characters in body
|
| Sep 15, 2012 at 8:03 | history | edited | T.R. | CC BY-SA 3.0 |
deleted 91 characters in body
|
| Sep 15, 2012 at 7:57 | history | edited | T.R. | CC BY-SA 3.0 |
added 91 characters in body
|
| Sep 15, 2012 at 5:40 | history | asked | T.R. | CC BY-SA 3.0 |