اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the threshold of spread-out contact process percolation
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the stationary distribution of the (spread-out) $d$-dimensional contact process from the point of view of site percolation. In this process, vertices of $mathbb{Z}^d$ can be healthy (state 0) or infected (state 1). With rate one infected sites recover, and with rate $lambda$ they transmit the infection to some other vertex chosen uniformly within a ball of radius $R$. The classical phase transition result for this process states that there is a critical value $lambda_c(R)$ such that the process has a non-trivial stationary distribution if and only if $lambda > lambda_c(R)$. In configurations sampled from this stationary distribution, we study nearest-neighbor site percolation of the set of infected sites; the associated percolation threshold is denoted $lambda_p(R)$. We prove that $lambda_p(R)$ converges to $1/(1-p_c)$ as $R$ tends to infinity, where $p_c$ is the threshold for Bernoulli site percolation on $mathbb{Z}^d$. As a consequence, we prove that $lambda_p(R) > lambda_c(R)$ for large enough $R$, answering an open question of Liggett and Steif in the spread-out case.
قيم البحث
اقرأ أيضاً
A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that on homogeneous trees the critical values $lambda_1$ and $lambda_2$ for global and local survival were different. He also considered trees with pe
riodic degree sequences, and Galton-Watson trees. Here, we will consider periodic trees in which the number of children in successive generation is $(n,a_1,ldots, a_k)$ with $max_i a_i le Cn^{1-delta}$ and $log(a_1 cdots a_k)/log n to b$ as $ntoinfty$. We show that the critical value for local survival is asymptotically $sqrt{c (log n)/n}$ where $c=(k-b)/2$. This supports Pemantles claim that the critical value is largely determined by the maximum degree, but it also shows that the smaller degrees can make a significant contribution to the answer.
A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that the critical values $lambda_1$ and $lambda_2$ for global and local survival were different. Here, we will consider the case of trees in which the
degrees of vertices are periodic. We will compute bounds on $lambda_1$ and $lambda_2$ and for the corresponding critical values $lambda_g$ and $lambda_ell$ for branching random walk. Much of what we find for period two $(a,b)$ trees was known to Pemantle. However, two significant new results give sharp asymptotics for the critical value $lambda_2$ of $(1,n)$ trees and generalize that result to the $(a_1,ldots, a_k, n)$ tree when $max_i a_i le n^{1-epsilon}$ and $a_1 cdots a_k = n^b$. We also give results for $lambda_g$ and $lambda_ell$ on $(a,b,c)$ trees. Since the values come from solving cubic equations, the explicit formulas are not pretty, but it is surprising that they depend only on $a+b+c$ and $abc$.
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 a contact process on $Z^d$ with two species that interact in a symbiotic manner. Each site can either be vacant or occupied by individuals of species $A$ and/or $B$. Multiple occupancy by the same species at a single site is prohibited. T
he name symbiotic comes from the fact that if only one species is present at a site then that particle dies with rate 1 but if both species are present then the death rate is reduced to $mu le 1$ for each particle at that site. We show the critical birth rate $lambda_c(mu)$ for weak survival is of order $sqrt{mu}$ as $mu to 0$. Mean-field calculations predict that when $mu < 1/2$ there is a discontinuous transition as $lambda$ is varied. In contrast, we show that, in any dimension, the phase transition is continuous. To be fair to physicists the paper that introduced the model, the authors say that the symbiotic contact process is in the directed percolation universality class and hence has a continuous transition. However, a 2018 paper asserts that the transition is discontinuous above the upper critical dimension, which is 4 for oriented percolation.
We are interested in the spread of an epidemic between two communities that have higher connectivity within than between them. We model the two communities as independent Erdos-Renyi random graphs, each with n vertices and edge probability p = n^{a-1
} (0<a<1), then add a small set of bridge edges, B, between the communities. We model the epidemic on this network as a contact process (Susceptible-Infected-Susceptible infection) with infection rate lambda and recovery rate 1. If nplambda = b > 1 then the contact process on the Erdos-Renyi random graph is supercritical, and we show that it survives for exponentially long. Further, let tau be the time to infect a positive fraction of vertices in the second community when the infection starts from a single vertex in the first community. We show that on the event that the contact process survives exponentially long, tau |B|/(np) converges in distribution to an exponential random variable with a specified rate. These results generalize to a graph with N communities.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
