Premium
Multirange percolation on oriented trees: Critical curve and limit behavior
Author(s) -
Lima Bernardo N. B.,
Szabó Réka,
Valesin Daniel
Publication year - 2023
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.21104
Subject(s) - mathematics , percolation (cognitive psychology) , vertex (graph theory) , combinatorics , percolation critical exponents , limit (mathematics) , percolation theory , statistical physics , critical exponent , graph , discrete mathematics , topology (electrical circuits) , physics , geometry , mathematical analysis , neuroscience , biology , scaling
We consider an inhomogeneous oriented percolation model introduced by de Lima, Rolla and Valesin. In this model, the underlying graph is an oriented rooted tree in which each vertex points to each of its d $$ d $$ children with “short” edges, and in addition, each vertex points to each of its d k$$ {d}^k $$ descendant at a fixed distance k $$ k $$ with “long” edges. A bond percolation process is then considered on this graph, with the prescription that independently, short edges are open with probability p $$ p $$ and long edges are open with probability q $$ q $$ . We study the behavior of the critical curve q c = q c ( p , k , d ) $$ {q}_c={q}_c\left(p,k,d\right) $$ : we find the first two terms in the expansion of q c$$ {q}_c $$ as k → ∞ $$ k\to \infty $$ . We also prove limit theorems for the percolation cluster in the supercritical, subcritical and critical regimes.