ترغب بنشر مسار تعليمي؟ اضغط هنا

Accessiblility Percolation with Crossing Valleys on $n$-ary Trees

64   0   0.0 ( 0 )
 نشر من قبل Alejandro Roldan
 تاريخ النشر 2017
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

In this paper we study a variation of the accessibility percolation model, this is also motivated by evolutionary biology and evolutionary computation. Consider a tree whose vertices are labeled with random numbers. We study the probability of having a monotone subsequence of a path from the root to a leaf, where any $k$ consecutive vertices in the path contain at least one vertex of the subsequence. An $n$-ary tree, with height $h$, is a tree whose vertices at distance at most $h-1$ to the root have $n$ children. For the case of $n$-ary trees, we prove that, as $h$ tends to infinity the probability of having such subsequence: tends to 1, if $n$ grows significantly faster than $sqrt[k]{h/(ek)}$; and tends to 0, if $n$ grows significantly slower than $sqrt[k]{h/(ek)}$.



قيم البحث

اقرأ أيضاً

We study the recurrence of one-per-site frog model $text{FM}(d, p)$ on a $d$-ary tree with drift parameter $pin [0,1]$, which determines the bias of frogs random walks. We are interested in the minimal drift $p_{d}$ so that the frog model is recurren t. Using a coupling argument together with a generating function technique, we prove that for all $d ge 2$, $p_{d}le 1/3$, which is the optimal universal upper bound.
151 - Jesse Goodman 2009
In invasion percolation, the edges of successively maximal weight (the outlets) divide the invasion cluster into a chain of ponds separated by outlets. On the regular tree, the ponds are shown to grow exponentially, with law of large numbers, central limit theorem and large deviation results. The tail asymptotics for a fixed pond are also studied and are shown to be related to the asymptotics of a critical percolation cluster, with a logarithmic correction.
We consider Bernoulli bond percolation on oriented regular trees, where besides the usual short bonds, all bonds of a certain length are added. Independently, short bonds are open with probability $p$ and long bonds are open with probability $q$. We study properties of the critical curve which delimits the set of pairs $(p,q)$ for which there are almost surely no infinite paths. We also show that this curve decreases with respect to the length of the long bonds.
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$ children with `short edges, and in additio n, each vertex points to each of its $d^k$ descendant at a fixed distance $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$ and long edges are open with probability $q$. We study the behavior of the critical curve $q_c(p)$: we find the first two terms in the expansion of $q_c(p)$ as $k to infty$, and prove that the critical curve lies strictly above the critical curve of a related branching process, in the relevant parameter region. We also prove limit theorems for the percolation cluster in the supercritical, subcritical and critical regimes.
We study level-set percolation of the Gaussian free field on the infinite $d$-regular tree for fixed $dgeq 3$. Denoting by $h_star$ the critical value, we obtain the following results: for $h>h_star$ we derive estimates on conditional exponential mom ents of the size of a fixed connected component of the level set above level $h$; for $h<h_star$ we prove that the number of vertices connected over distance $k$ above level $h$ to a fixed vertex grows exponentially in $k$ with positive probability. Furthermore, we show that the percolation probability is a continuous function of the level $h$, at least away from the critical value $h_star$. Along the way we also obtain matching upper and lower bounds on the eigenfunctions involved in the spectral characterisation of the critical value $h_star$ and link the probability of a non-vanishing limit of the martingale used therein to the percolation probability. A number of the results derived here are applied in the accompanying paper [AC2].
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا