اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOnce reinforced random walk on $mathbb{Z}times Gamma$
149
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We revisit an unpublished paper of Vervoort (2002) on the once reinforced random walk, and prove that this process is recurrent on any graph of the form $mathbb{Z}times Gamma$, with $Gamma$ a finite graph, for sufficiently large reinforcement parameter. We also obtain a shape theorem for the set of visited sites, and show that the fluctuations around this shape are of polynomial order. The proof involves sharp general estimates on the time spent on subgraphs of the ambiant graph which might be of independent interest.
قيم البحث
اقرأ أيضاً
We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root. We prove that in the setting of multiplicative once-reinf
orcement the ORbRW can be recurrent even when the underlying biased random walk is ballistic. We also prove that, on Galton-Watson trees without leaves, the speed is positive in the transient regime. Finally, we prove that, on regular trees, the speed of the ORbRW is monotone decreasing in the reinforcement parameter when the underlying random walk has high speed, and the reinforcement parameter is small.
In this paper, we reveal the branching structure for a non-homogeneous random walk with bounded jumps. The ladder time $T_1,$ the first hitting time of $[1,infty)$ by the walk starting from $0,$ could be expressed in terms of a non-homogeneous multit
ype branching process. As an application of the branching structure, we prove a law of large numbers of random walk in random environment with bounded jumps and specify the explicit invariant density for the Markov chain of ``the environment viewed from the particle .The invariant density and the limit velocity could be expressed explicitly in terms of the environment.
We study the scaling limit of the capacity of the range of a simple random walk on the integer lattice in dimension four. We establish a strong law of large numbers and a central limit theorem with a non-gaussian limit. The asymptotic behaviour is an
alogous to that found by Le Gall in 86 for the volume of the range in dimension two.
We consider random walk on dynamical percolation on the discrete torus $mathbb{Z}_n^d$. In previous work, mixing times of this process for $p<p_c(mathbb{Z}^d)$ were obtained in the annealed setting where one averages over the dynamical percolation en
vironment. Here we study exit times in the quenched setting, where we condition on a typical dynamical percolation environment. We obtain an upper bound for all $p$ which for $p<p_c$ matches the known lower bound.
Consider an arbitrary transient random walk on $Z^d$ with $dinN$. Pick $alphain[0,infty)$ and let $L_n(alpha)$ be the spatial sum of the $alpha$-th power of the $n$-step local times of the walk. Hence, $L_n(0)$ is the range, $L_n(1)=n+1$, and for int
egers $alpha$, $L_n(alpha)$ is the number of the $alpha$-fold self-intersections of the walk. We prove a strong law of large numbers for $L_n(alpha)$ as $ntoinfty$. Furthermore, we identify the asymptotic law of the local time in a random site uniformly distributed over the range. These results complement and contrast analogous results for recurrent walks in two dimensions recently derived by v{C}erny cite{Ce07}. Although these assertions are certainly known to experts, we could find no proof in the literature in this generality.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
