Timeline for Percolation on finite irregular trees
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24, 2021 at 1:44 | comment | added | Yuval Peres | Note that the 1-3 tress has only countably many rays, so the percolation probability is zero by countable additivity | |
| Nov 20, 2017 at 23:21 | vote | accept | Or Meir | ||
| Nov 20, 2017 at 12:10 | comment | added | Florian Lehner | I just edited in a proof sketch which I think generalises to higher degrees. | |
| Nov 20, 2017 at 12:08 | history | edited | Florian Lehner | CC BY-SA 3.0 |
added 518 characters in body
|
| Nov 20, 2017 at 11:47 | comment | added | Florian Lehner | I think the first proof of this can be found in R. Lyons, Random Walks and Percolation on Trees, Ann. Probab. 18 (3): 931-958, 1990. | |
| Nov 20, 2017 at 8:09 | comment | added | Or Meir | Where can I find the proof that the percolation probability of the 1-3-tree is 0? | |
| Nov 19, 2017 at 23:59 | comment | added | Or Meir | Thanks! The 1-3-tree is a good example. I cannot think of a reason for my trees not to have a similar structure. However, the average degree of the 1-3-tree is 2, which is rather small, whereas the average degree in my trees can be an arbitrary large constant. In order to get my question fully answered, I still need to check if the 1-3-tree can be changed to have a larger average degree. | |
| Nov 19, 2017 at 23:08 | history | answered | Florian Lehner | CC BY-SA 3.0 |