Locally Perturbed Random Walks with Unbounded Jumps

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages

Scientific paper

In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result to finite range random walks is straightforward. Here, however, we are interested in the situation when the random walk has unbounded range. Concretely we generalize the statement of \cite{SzT} to unbounded random walks whose jump distribution belongs to the domain of attraction of the normal law. We do this first: for diffusively scaled random walks on $\mathbf Z^d$ $(d \ge 2)$ having finite variance; and second: for random walks with distribution belonging to the non-normal domain of attraction of the normal law. This result can be applied to random walks with tail behavior analogous to that of the infinite horizon Lorentz-process; these, in particular, have infinite variance, and convergence to Brownian motion holds with the superdiffusive $\sqrt{n \log n}$ scaling.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Locally Perturbed Random Walks with Unbounded Jumps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Locally Perturbed Random Walks with Unbounded Jumps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locally Perturbed Random Walks with Unbounded Jumps will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-28003

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.