On perturbations that preserve the connectivity properties in tree percolations
Abstract
We consider a general bond percolation on an infinite locally finite tree, where the edge retention probabilities pe are replaced by \1,q|e|pe\, where \qn\n 1 is a sequence of positive perturbation factors and |e| denotes the distance between the edge e and the root. If the original percolation model admits infinite clusters, it is of interest to investigate under which perturbations 0<qn 1 this connectivity property is preserved. Conversely, if the original percolation does not admit infinite clusters, we are led to study the stability of such a property under perturbations satisfying qn 1. In both cases, under minimal assumptions on the original model, we show that the percolative behaviour is stable against certain quantitative non-trivial perturbations. We also discuss an application of our results to the Erdős similarity conjecture for Cantor sets.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.