Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA first order phase transition in the threshold-$thetage 2$ contact process on random $r$-regular graphs and $r$-trees
187
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider the discrete-time threshold-$theta ge 2$ contact process on a random r-regular graph on n vertices. In this process, a vertex with at least theta occupied neighbors at time t will be occupied at time t+1 with probability p, and vacant otherwise. We show that if $theta ge 2$ and $r ge theta+2$, $epsilon_1$ is small and p is at least $p_1(epsilon_1)$, then starting from all vertices occupied the fraction of occupied vertices stays above $1-2epsilon_1$ up to time $exp(gamma_1(r)n)$ with probability at least $1 - exp(-gamma_1(r)n)$. In the other direction, we show that for $p_2 < 1$ there is an $epsilon_2(p_2)>0$ so that if $p le p_2$ and the number of occupied vertices in the initial configuration is at most $epsilon_2(p_2)n$, then with high probability all vertices are vacant at time $C_2(p_2) log(n)$. These two conclusions imply that on the random r-regular graph there cannot be a quasi-stationary distribution with density of occupied vertices between 0 and $epsilon_2(p_1)$, and allow us to conclude that the process on the r-tree has a first order phase transition.
rate research
Read More
The key to our investigation is an improved (and in a sense sharp) understanding of the survival time of the contact process on star graphs. Using these results, we show that for the contact process on Galton-Watson trees, when the offspring distribution (i) is subexponential the critical value for local survival $lambda_2=0$ and (ii) when it is geometric($p$) we have $lambda_2 le C_p$, where the $C_p$ are much smaller than previous estimates. We also study the critical value $lambda_c(n)$ for prolonged persistence on graphs with $n$ vertices generated by the configuration model. In the case of power law and stretched exponential distributions where it is known $lambda_c(n) to 0$ we give estimates on the rate of convergence. Physicists tell us that $lambda_c(n) sim 1/Lambda(n)$ where $Lambda(n)$ is the maximum eigenvalue of the adjacency matrix. Our results show that this is not correct.
We consider the contact process on the model of hyperbolic random graph, in the regime when the degree distribution obeys a power law with exponent $chi in(1,2)$ (so that the degree distribution has finite mean and infinite second moment). We show that the probability of non-extinction as the rate of infection goes to zero decays as a power law with an exponent that only depends on $chi$ and which is the same as in the configuration model, suggesting some universality of this critical exponent. We also consider fini
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a metastable result for the extinction time is also proved.
Consider a random regular graph with degree $d$ and of size $n$. Assign to each edge an i.i.d. exponential random variable with mean one. In this paper we establish a precise asymptotic expression for the maximum number of edges on the shortest-weight paths between a fixed vertex and all the other vertices, as well as between any pair of vertices. Namely, for any fixed $d geq 3$, we show that the longest of these shortest-weight paths has about $hat{alpha}log n$ edges where $hat{alpha}$ is the unique solution of the equation $alpha log(frac{d-2}{d-1}alpha) - alpha = frac{d-3}{d-2}$, for $alpha > frac{d-1}{d-2}$.
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 periodic 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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
