ترغب بنشر مسار تعليمي؟ اضغط هنا

Biased random walk on the interlacement set

100   0   0.0 ( 0 )
 نشر من قبل Serguei Popov
 تاريخ النشر 2016
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

We study a biased random walk on the interlacement set of $mathbb{Z}^d$ for $dgeq 3$. Although the walk is always transient, we can show, in the case $d=3$, that for any value of the bias the walk has a zero limiting speed and actually moves slower than any power.



قيم البحث

اقرأ أيضاً

289 - Antal A. Jarai , Minwei Sun 2021
We consider a simple random walk on $mathbb{Z}^d$ started at the origin and stopped on its first exit time from $(-L,L)^d cap mathbb{Z}^d$. Write $L$ in the form $L = m N$ with $m = m(N)$ and $N$ an integer going to infinity in such a way that $L^2 s im A N^d$ for some real constant $A > 0$. Our main result is that for $d ge 3$, the projection of the stopped trajectory to the $N$-torus locally converges, away from the origin, to an interlacement process at level $A d sigma_1$, where $sigma_1$ is the exit time of a Brownian motion from the unit cube $(-1,1)^d$ that is independent of the interlacement process. The above problem is a variation on results of Windisch (2008) and Sznitman (2009).
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.
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition kernels w ithout the assumption of uniform ellipticity or nearest-neighbour jumps. Specifically, we obtain a strong law of large numbers, a functional central limit theorem and large deviation estimates for the position of the random walker under the annealed law in a high density regime. The main obstacle is the intrinsic lack of monotonicity in higher-dimensional, non-nearest neighbour settings. Here we develop more general renormalization and renewal schemes that allow us to overcome this issue. As a second application of our methods, we provide an alternative proof of the ballistic behaviour of the front of (the discrete-time version of) the infection model introduced in [23].
We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on particles. Su rprisingly, the random walker may behave very differently depending on whether the underlying environment particles perform lazy or non-lazy random walks, which is related to a notion of permeability of the system. We also provide a strong law of large numbers, a functional central limit theorem and large deviation bounds under an ellipticity condition.
Coalescing random walk on a unimodular random rooted graph for which the root has finite expected degree visits each site infinitely often almost surely. A corollary is that an opinion in the voter model on such graphs has infinite expected lifetime. Additionally, we deduce an adaptation of our main theorem that holds uniformly for coalescing random walk on finite random unimodular graphs with degree distribution stochastically dominated by a probability measure with finite mean.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا