Timeline for Percolation on finite irregular trees
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 20, 2017 at 23:21 | vote | accept | Or Meir | ||
| S Nov 20, 2017 at 20:15 | history | suggested | F. C. |
added the tag trees
|
|
| Nov 20, 2017 at 18:01 | review | Suggested edits | |||
| S Nov 20, 2017 at 20:15 | |||||
| Nov 19, 2017 at 23:08 | answer | added | Florian Lehner | timeline score: 4 | |
| Nov 19, 2017 at 22:44 | history | edited | Or Meir | CC BY-SA 3.0 |
added 16 characters in body
|
| Nov 19, 2017 at 22:34 | history | edited | Or Meir | CC BY-SA 3.0 |
added constraint I forgot to mention earlier.
|
| Nov 19, 2017 at 22:29 | history | edited | Or Meir | CC BY-SA 3.0 |
added constraint I forgot to mention earlier.
|
| Nov 19, 2017 at 22:25 | comment | added | Or Meir | Thanks, there is definitely some information I forgot to mention (namely, that there is also a bound on the maximal degree). I am adding it now. | |
| Nov 19, 2017 at 21:37 | comment | added | Benoît Kloeckner | @AnthonyQuas: I was thinking about my answer before hitting the "answer" button, and only saw your comment afterward. We agree (but I wonder what would happen if the leftmost vertex has sufficiently many children. | |
| Nov 19, 2017 at 21:35 | answer | added | Benoît Kloeckner | timeline score: 1 | |
| Nov 19, 2017 at 21:31 | comment | added | Anthony Quas | No. That’s definitely not enough information. One such tree is that you make every vertex have a single child except for one very productive vertex on the left side of each level (so each productive node is the child of another productive node). The probability that there’s a path from the root to a leaf is extremely low. | |
| Nov 19, 2017 at 20:57 | history | asked | Or Meir | CC BY-SA 3.0 |