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

Stretched exponential decay for subcritical parking times on $mathbb{Z}^d$

77   0   0.0 ( 0 )
 نشر من قبل David Sivakoff
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




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

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 r of particles. At time 0, the particles at the origin are activated and assigned type 1 and the particles at one other site are activated and assigned type 2, while all other particles are sleeping. When an active type $i$ particle moves to a new site, any sleeping particles there are activated and assigned type $i$, with an arbitrary tie-breaker deciding the type if the site is hit by particles of both types in the same time step. We show that the event $G_i$ that type $i$ activates infinitely many particles has positive probability for all $p_1,p_2in(0,1]$ ($i=1,2$). Furthermore, if $p_1=p_2$, then the types can coexist in the sense that $mathbb{P}(G_1cap G_2)>0$. We also formulate several open problems. For instance, we conjecture that, when the initial number of particles per site has a heavy tail, the types can coexist also when $p_1 eq p_2$.
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 cise logarithmic asymptotics of the expectation of $exp{theta_t |ell_t|_p}$ for scales $theta_t>0$ that are bounded from above, possibly tending to zero. The speed is identified in terms of mixed powers of $t$ and $theta_t$, and the precise rate is characterized in terms of a variational formula, which is in close connection to the {it Gagliardo-Nirenberg inequality}. As a corollary, we obtain a large-deviation principle for $|ell_t|_p/(t r_t)$ for deviation functions $r_t$ satisfying $t r_tggE[|ell_t|_p]$. Informally, it turns out that the random walk homogeneously squeezes in a $t$-dependent box with diameter of order $ll t^{1/d}$ to produce the required amount of self-intersections. Our main tool is an upper bound for the joint density of the local times of the walk.
200 - Leonardo T. Rolla 2019
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 hat of Activated Random Walks. Long-range effects intrinsic to the conservative dynamics and lack of a simple algebraic structure cause standard tools and techniques to break down. This makes the mathematical study of this model remarkably challenging. Yet, some exciting progress has been made in the last ten years, with the development of a framework of tools and methods which is finally becoming more structured. In these lecture notes we present the existing results and reproduce the techniques developed so far.
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 er. 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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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