اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConstrained-degree percolation in a random environment
88
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider the Constrained-degree percolation model with random constraints on the square lattice and prove a non-trivial phase transition. In this model, each vertex has an independently distributed random constraint $jin {0,1,2,3}$ with probability $rho_j$. Each edge $e$ tries to open at a random uniform time $U_e$, independently of all other edges. It succeeds if at time $U_e$ both its end-vertices have degrees strictly smaller than their respectively attached constraints. We show that this model undergoes a non-trivial phase transition when $rho_3$ is sufficiently large. The proof consists of a decoupling inequality, the continuity of the probability for local events, together with a coarse-graining argument.
قيم البحث
اقرأ أيضاً
In the Constrained-degree percolation model on a graph $(mathbb{V},mathbb{E})$ there are a sequence, $(U_e)_{einmathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open at time $U_e$,
it succeeds if both its end-vertices would have degrees at most $k-1$. We prove a phase transition theorem for this model on the square lattice $mathbb{L}^2$, as well as on the d-ary regular tree. We also prove that on the square lattice the infinite cluster is unique in the supercritical phase.
Exponential single server queues with state dependent arrival and service rates are considered which evolve under influences of external environments. The transitions of the queues are influenced by the environments state and the movements of the env
ironment depend on the status of the queues (bi-directional interaction). The structure of the environment is constructed in a way to encompass various models from the recent Operation Research literature, where a queue is coupled e.g. with an inventory or with reliability issues. With a Markovian joint queueing-environment process we prove separability for a large class of such interactive systems, i.e. the steady state distribution is of product form and explicitly given: The queue and the environment processes decouple asymptotically and in steady state. For non-separable systems we develop ergodicity criteria via Lyapunov functions. By examples we show principles for bounding throughputs of non-separable systems by throughputs of two separable systems as upper and lower bound.
The integer points (sites) of the real line are marked by the positions of a standard random walk. We say that the set of marked sites is weakly, moderately or strongly sparse depending on whether the jumps of the standard random walk are supported b
y a bounded set, have finite or infinite mean, respectively. Focussing on the case of strong sparsity we consider a nearest neighbor random walk on the set of integers having jumps $pm 1$ with probability $1/2$ at every nonmarked site, whereas a random drift is imposed at every marked site. We prove new distributional limit theorems for the so defined random walk in a strongly sparse random environment, thereby complementing results obtained recently in Buraczewski et al. (2018+) for the case of moderate sparsity and in Matzavinos et al. (2016) for the case of weak sparsity. While the random walk in a strongly sparse random environment exhibits either the diffusive scaling inherent to a simple symmetric random walk or a wide range of subdiffusive scalings, the corresponding limit distributions are non-stable.
A bootstrap percolation process on a graph G is an infection process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every uninfected node which has at least r infected neighbours becomes infected
and remains so forever. The parameter r > 1 is fixed. We consider this process in the case where the underlying graph is an inhomogeneous random graph whose kernel is of rank 1. Assuming that initially every vertex is infected independently with probability p > 0, we provide a law of large numbers for the number of vertices that will have been infected by the end of the process. We also focus on a special case of such random graphs which exhibit a power-law degree distribution with exponent in (2,3). The first two authors have shown the existence of a critical function a_c(n) such that a_c(n)=o(n) with the following property. Let n be the number of vertices of the underlying random graph and let a(n) be the number of the vertices that are initially infected. Assume that a set of a(n) vertices is chosen randomly and becomes externally infected. If a(n) << a_c(n), then the process does not evolve at all, with high probability as n grows, whereas if a(n)>> a_c(n), then with high probability the final set of infected vertices is linear. Using the techniques of the previous theorem, we give the precise asymptotic fraction of vertices which will be eventually infected when a(n) >> a_c (n) but a(n) = o(n). Note that this corresponds to the case where p approaches 0.
It is well known that the distribution of simple random walks on $bf{Z}$ conditioned on returning to the origin after $2n$ steps does not depend on $p= P(S_1 = 1)$, the probability of moving to the right. Moreover, conditioned on ${S_{2n}=0}$ the max
imal displacement $max_{kleq 2n} |S_k|$ converges in distribution when scaled by $sqrt{n}$ (diffusive scaling). We consider the analogous problem for transient random walks in random environments on $bf{Z}$. We show that under the quenched law $P_omega$ (conditioned on the environment $omega$), the maximal displacement of the random walk when conditioned to return to the origin at time $2n$ is no longer necessarily of the order $sqrt{n}$. If the environment is nestling (both positive and negative local drifts exist) then the maximal displacement conditioned on returning to the origin at time $2n$ is of order $n^{kappa/(kappa+1)}$, where the constant $kappa>0$ depends on the law on environment. On the other hand, if the environment is marginally nestling or non-nestling (only non-negative local drifts) then the maximal displacement conditioned on returning to the origin at time $2n$ is at least $n^{1-varepsilon}$ and at most $n/(ln n)^{2-varepsilon}$ for any $varepsilon>0$. As a consequence of our proofs, we obtain precise rates of decay for $P_omega(X_{2n}=0)$. In particular, for certain non-nestling environments we show that $P_omega(X_{2n}=0) = exp{-Cn -Cn/(ln n)^2 + o(n/(ln n)^2) }$ with explicit constants $C,C>0$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
