Timeline for Some references to understand the proof of a theorem about simple random walk on galton watson trees
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 20, 2016 at 18:14 | comment | added | user115608 | @MichaelHardy yes | |
| Aug 20, 2016 at 16:06 | answer | added | R W | timeline score: 4 | |
| Aug 20, 2016 at 15:56 | comment | added | Nate Eldredge | Lyons has written an "informal version" of this paper: MR1395615 Lyons, Russell. How fast and where does a random walker move on a random tree? Random discrete structures (Minneapolis, MN, 1993), 185–198, IMA Vol. Math. Appl., 76, Springer, New York, 1996. dx.doi.org/10.1007/978-1-4612-0719-1_12 pages.iu.edu/~rdlyons/ps/dimTalk.ps You might like to start by reading that. | |
| Aug 20, 2016 at 13:08 | comment | added | Michael Hardy | By a "simple" random walk to you mean the for each node, the probabilities of picking edges incident to that node are all equal? | |
| Aug 20, 2016 at 13:03 | history | edited | Michael Hardy | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Aug 20, 2016 at 9:05 | history | edited | user115608 | CC BY-SA 3.0 |
edited title
|
| Aug 20, 2016 at 8:45 | history | asked | user115608 | CC BY-SA 3.0 |