Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Monotonicity Result for the Range of a Perturbed Random Walk
156
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of sites visited by the perturbed random walk up to time n is always larger than or equal to that for the unperturbed walk. This intriguing problem arises from the study of a particle among a Poisson system of moving traps with sub-diffusive trap motion. In particular, our result implies a variant of the Pascal principle, which asserts that among all deterministic trajectories the particle can follow, the constant trajectory maximizes the particles survival probability up to any time t>0.
rate research
Read More
We obtain estimates for large and moderate deviations for the capacity of the range of a random walk on $mathbb{Z}^d$, in dimension $dge 5$, both in the upward and downward directions. The results are analogous to those we obtained for the volume of the range in two companion papers [AS17, AS19]. Interestingly, the main steps of the strategy we developed for the latter apply in this seemingly different setting, yet the details of the analysis are different
We obtain sharp upper and lower bounds for the moderate deviations of the volume of the range of a random walk in dimension five and larger. Our results encompass two regimes: a Gaussian regime for small deviations, and a stretched exponential regime for larger deviations. In the latter regime, we show that conditioned on the moderate deviations event, the walk folds a small part of its range in a ball-like subset. Also, we provide new path properties, in dimension three as well. Besides the key role Newtonian capacity plays in this study, we introduce two original ideas, of general interest, which strengthen the approach developed in cite{AS}.
We find formulas for the macroscopic Minkowski and Hausdorff dimensions of the range of an arbitrary transient walk in Z^d. This endeavor solves a problem of Barlow and Taylor (1991).
We consider a one-dimensional recurrent random walk in random environment (RWRE). We show that the - suitably centered - empirical distributions of the RWRE converge weakly to a certain limit law which describes the stationary distribution of a random walk in an infinite valley. The construction of the infinite valley goes back to Golosov. As a consequence, we show weak convergence for both the maximal local time and the self-intersection local time of the RWRE and also determine the exact constant in the almost sure upper limit of the maximal local time.
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 analogous to that found by Le Gall in 86 for the volume of the range in dimension two.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
