اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMonotonicity and phase diagram for multi-range percolation on oriented trees
252
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 consider different problems within the general theme of long-range percolation on oriented graphs. Our aim is to settle the so-called truncation question, described as follows. We are given probabilities that certain long-range oriented bonds are
open; assuming that the sum of these probabilities is infinite, we ask if the probability of percolation is positive when we truncate the graph, disallowing bonds of range above a possibly large but finite threshold. We give some conditions in which the answer is affirmative. We also translate some of our results on oriented percolation to the context of a long-range contact process.
Recently, Holmes and Perkins identified conditions which ensure that for a class of critical lattice models the scaling limit of the range is the range of super-Brownian motion. One of their conditions is an estimate on a spatial moment of order high
er than four, which they verified for the sixth moment for spread-out lattice trees in dimensions $d>8$. Chen and Sakai have proved the required moment estimate for spread-out critical oriented percolation in dimensions $d+1>4+1$. We prove estimates on all moments for the spread-out critical contact process in dimensions $d>4$, which in particular fulfills the spatial moment condition of Holmes and Perkins. Our method of proof is relatively simple, and, as we show, it applies also to oriented percolation and lattice trees. Via the convergence results of Holmes and Perkins, the upper bounds on the spatial moments can in fact be promoted to asymptotic formulas with explicit constants.
We consider oriented long-range percolation on a graph with vertex set $mathbb{Z}^d times mathbb{Z}_+$ and directed edges of the form $langle (x,t), (x+y,t+1)rangle$, for $x,y$ in $mathbb{Z}^d$ and $t in mathbb{Z}_+$. Any edge of this form is open wi
th probability $p_y$, independently for all edges. Under the assumption that the values $p_y$ do not vanish at infinity, we show that there is percolation even if all edges of length more than $k$ are deleted, for $k$ large enough. We also state the analogous result for a long-range contact process on $mathbb{Z}^d$.
We consider random walk and self-avoiding walk whose 1-step distribution is given by $D$, and oriented percolation whose bond-occupation probability is proportional to $D$. Suppose that $D(x)$ decays as $|x|^{-d-alpha}$ with $alpha>0$. For random wal
k in any dimension $d$ and for self-avoiding walk and critical/subcritical oriented percolation above the common upper-critical dimension $d_{mathrm{c}}equiv2(alphawedge2)$, we prove large-$t$ asymptotics of the gyration radius, which is the average end-to-end distance of random walk/self-avoiding walk of length $t$ or the average spatial size of an oriented percolation cluster at time $t$. This proves the conjecture for long-range self-avoiding walk in [Ann. Inst. H. Poincar{e} Probab. Statist. (2010), to appear] and for long-range oriented percolation in [Probab. Theory Related Fields 142 (2008) 151--188] and [Probab. Theory Related Fields 145 (2009) 435--458].
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
