
arXiv: 1711.10672
We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation induces a probability measure on infinite paths from the root. We show that under certain conditions of the progeny distribution, this measure is absolutely continuous with respect to the limit uniform measure. This confirms that invasion percolation, an efficient self-tuning algorithm, may be used to sample approximately from the limit uniform distribution. Additionally, we analyze the forward maximal weights along the backbone of the invasion cluster and prove a limit law for the process.
35 pages, 1 figure
pivot, 60K35, backbone, Probability (math.PR), FOS: Mathematics, Interacting random processes; statistical mechanics type models; percolation theory, limit uniform, self-organized criticality, Poisson point process, Mathematics - Probability, incipient infinite cluster
pivot, 60K35, backbone, Probability (math.PR), FOS: Mathematics, Interacting random processes; statistical mechanics type models; percolation theory, limit uniform, self-organized criticality, Poisson point process, Mathematics - Probability, incipient infinite cluster
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
