Timeline for "The" random tree
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 13, 2013 at 22:25 | answer | added | James Prichard | timeline score: 3 | |
| Sep 27, 2013 at 13:40 | comment | added | Louigi Addario-Berry | As suspected by Greg Kuperberg, the random recursive tree is rather different from Aldous's random tree and its finite analogue (a uniform spanning tree of K_n). I happen to have written a blog post, rather recently, about (some of) the differences between them, including their respective heights (log n vs. n^{1/2}). methemedantics.wordpress.com/2013/09/15/… | |
| Sep 27, 2013 at 13:36 | comment | added | Louigi Addario-Berry | Incidentally, for finite n the tree you construct is called a "random recursive tree", and its properties are very well understood. The resulting infinite tree (ignoring vertex labels) is essentially what is called the Ulam Harris tree. | |
| S Sep 27, 2013 at 9:57 | history | suggested | Sergiy Kozerenko | CC BY-SA 3.0 |
TeX editions
|
| Sep 27, 2013 at 9:51 | review | Suggested edits | |||
| S Sep 27, 2013 at 9:57 | |||||
| Mar 5, 2013 at 23:00 | comment | added | Brendan McKay | @Ilya: vertex $i$ might not be adjacent to lower-numbered vertices at all. | |
| Mar 5, 2013 at 21:53 | answer | added | Samuele Giraudo | timeline score: 3 | |
| Nov 19, 2009 at 1:46 | vote | accept | Ian Agol | ||
| Nov 18, 2009 at 20:24 | comment | added | Ilya Nikokoshev |
One can perform the similar construction: for a given i, take of the edges between i and some smaller vertex at random; then repeat. The tree will have possess the same two properties, so it's all the same again.
|
|
| Nov 18, 2009 at 20:19 | comment | added | Harrison Brown | A related question that just occurred to me: Is a random spanning tree of the Rado graph isomorphic to "the" random tree? Actually I think the hard part of this question is figuring out what the right definition of "random spanning tree" is for the Rado graph. | |
| Nov 18, 2009 at 20:04 | answer | added | Andrew Stacey | timeline score: 1 | |
| Nov 18, 2009 at 19:59 | answer | added | S. Carnahan♦ | timeline score: 4 | |
| Nov 18, 2009 at 19:54 | answer | added | Greg Kuperberg | timeline score: 6 | |
| Nov 18, 2009 at 19:42 | answer | added | Ilya Nikokoshev | timeline score: 11 | |
| Nov 18, 2009 at 19:21 | history | asked | Ian Agol | CC BY-SA 2.5 |