ﻻ يوجد ملخص باللغة العربية
In the parking model on $mathbb{Z}^d$, each vertex is initially occupied by a car (with probability $p$) or by a vacant parking spot (with probability $1-p$). Cars perform independent random walks and when they enter a vacant spot, they park there, thereby rendering the spot occupied. Cars visiting occupied spots simply keep driving (continuing their random walk). It is known that $p=1/2$ is a critical value in the sense that the origin is a.s. visited by finitely many distinct cars when $p<1/2$, and by infinitely many distinct cars when $pgeq 1/2$. Furthermore, any given car a.s. eventually parks for $p leq 1/2$ and with positive probability does not park for $p > 1/2$. We study the subcritical phase and prove that the tail of the parking time $tau$ of the car initially at the origin obeys the bounds [ expleft( - C_1 t^{frac{d}{d+2}}right) leq mathbb{P}_p(tau > t) leq expleft( - c_2 t^{frac{d}{d+2}}right) ] for $p>0$ sufficiently small. For $d=1$, we prove these inequalities for all $p in [0,1/2)$. This result presents an asymmetry with the supercritical phase ($p>1/2$), where methods of Bramson--Lebowitz imply that for $d=1$ the corresponding tail of the parking time of the parking spot of the origin decays like $e^{-csqrt{t}}$. Our exponent $d/(d+2)$ also differs from those previously obtained in the case of moving obstacles.
A two-type version of the frog model on $mathbb{Z}^d$ is formulated, where active type $i$ particles move according to lazy random walks with probability $p_i$ of jumping in each time step ($i=1,2$). Each site is independently assigned a random numbe
We give the ``quenched scaling limit of Bouchauds trap model in ${dge 2}$. This scaling limit is the fractional-kinetics process, that is the time change of a $d$-dimensional Brownian motion by the inverse of an independent $alpha$-stable subordinator.
Fix $p>1$, not necessarily integer, with $p(d-2)<d$. We study the $p$-fold self-intersection local time of a simple random walk on the lattice $Z^d$ up to time $t$. This is the $p$-norm of the vector of the walkers local times, $ell_t$. We derive pre
Some stochastic systems are particularly interesting as they exhibit critical behavior without fine-tuning of a parameter, a phenomenon called self-organized criticality. In the context of driven-dissipative steady states, one of the main models is t
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 paramet