Timeline for Growth models with lookahead
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 8, 2019 at 16:37 | comment | added | Sam Hopkins | This does not directly address your question, but: the random path in a graph from $v$ to $w$ weighted according to the uniform random spanning tree is an example where we might think we need to "look ahead" to produce a random instance, but actually Wilson's loop-erased random walk algorithm (en.wikipedia.org/wiki/Loop-erased_random_walk) gives a way of producing this UST-weighted path by building it up one edge at a time (except we need to use edge erasures). There could possibly be a similar procedure for your model. | |
| May 21, 2018 at 4:05 | history | edited | James Propp | CC BY-SA 4.0 |
Fixed wording
|
| May 21, 2018 at 2:43 | history | asked | James Propp | CC BY-SA 4.0 |