اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSurvival time of random walk in random environment among soft obstacles
121
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a Random Walk in Random Environment (RWRE) moving in an i.i.d. random field of obstacles. When the particle hits an obstacle, it disappears with a positive probability. We obtain quenched and annealed bounds on the tails of the survival time in the general $d$-dimensional case. We then consider a simplified one-dimensional model (where transition probabilities and obstacles are independent and the RWRE only moves to neighbour sites), and obtain finer results for the tail of the survival time. In addition, we study also the mixed probability measures (quenched with respect to the obstacles and annealed with respect to the transition probabilities and vice-versa) and give results for tails of the survival time with respect to these probability measures. Further, we apply the same methods to obtain bounds for the tails of hitting times of Branching Random Walks in Random Environment (BRWRE).
قيم البحث
اقرأ أيضاً
Place an obstacle with probability $1-p$ independently at each vertex of $mathbb Z^d$ and consider a simple symmetric random walk that is killed upon hitting one of the obstacles. For $d geq 2$ and $p$ strictly above the critical threshold for site p
ercolation, we condition on the environment such that the origin is contained in an infinite connected component free of obstacles. It has previously been shown that with high probability, the random walk conditioned on survival up to time $n$ will be localized in a ball of volume asymptotically $dlog_{1/p}n$. In this work, we prove that this ball is free of obstacles, and we derive the limiting one-time distributions of the random walk conditioned on survival. Our proof is based on obstacle modifications and estimates on how such modifications affect the probability of the obstacle configurations as well as their associated Dirichlet eigenvalues, which is of independent interest.
We consider a discrete time simple symmetric random walk among Bernoulli obstacles on $mathbb{Z}^d$, $dgeq 2$, where the walk is killed when it hits an obstacle. It is known that conditioned on survival up to time $N$, the random walk range is asympt
otically contained in a ball of radius $varrho_N=C N^{1/(d+2)}$ for any $dgeq 2$. For $d=2$, it is also known that the range asymptotically contains a ball of radius $(1-epsilon)varrho_N$ for any $epsilon>0$, while the case $dgeq 3$ remains open. We complete the picture by showing that for any $dgeq 2$, the random walk range asymptotically contains a ball of radius $varrho_N-varrho_N^epsilon$ for some $epsilon in (0,1)$. Furthermore, we show that its boundary is of size at most $varrho_N^{d-1}(log varrho_N)^a$ for some $a>0$.
We study survival of nearest-neighbour branching random walks in random environment (BRWRE) on ${mathbb Z}$. A priori there are three different regimes of survival: global survival, local survival, and strong local survival. We show that local and st
rong local survival regimes coincide for BRWRE and that they can be characterized with the spectral radius of the first moment matrix of the process. These results are generalizations of the classification of BRWRE in recurrent and transient regimes. Our main result is a characterization of global survival that is given in terms of Lyapunov exponents of an infinite product of i.i.d. $2times 2$ random matrices.
Let $xi(n, x)$ be the local time at $x$ for a recurrent one-dimensional random walk in random environment after $n$ steps, and consider the maximum $xi^*(n) = max_x xi(n,x)$. It is known that $limsup xi^*(n)/n$ is a positive constant a.s. We prove th
at $liminf_n (logloglog n)xi^*(n)/n$ is a positive constant a.s.; this answers a question of P. Revesz (1990). The proof is based on an analysis of the {em valleys /} in the environment, defined as the potential wells of record depth. In particular, we show that almost surely, at any time $n$ large enough, the random walker has spent almost all of its lifetime in the two deepest valleys of the environment it has encountered. We also prove a uniform exponential tail bound for the ratio of the expected total occupation time of a valley and the expected local time at its bottom.
We study one-dimensional nearest neighbour random walk in site-random environment. We establish precise (sharp) large deviations in the so-called ballistic regime, when the random walk drifts to the right with linear speed. In the sub-ballistic regim
e, when the speed is sublinear, we describe the precise probability of slowdown.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
