arXiv subjects
Publications and source records attributed to Pal Revesz.
A simple random walk and a Brownian motion are considered on a spider that is a collection of half lines (we call them legs) joined in the origin. We give a strong approximation of these two objects and their local times. For fixed number of legs we establish limit theorems on local and occupation times in n steps.
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.
We consider a simple symmetric random walk on a spider, that is a collection of half lines (we call them legs) joined at the origin. Our main question is the following: if the walker makes $n$ steps how high can he go up on all legs. This problem is discussed in two different situations; when the number of legs are increasing, as $n$ goes to infinity and when it is fixed.
We prove that the number gamma(N) of the zeros of a two-parameter simple random walk in its first N-by-N time steps is almost surely equal to N to the power 1+o(1) as N goes to infinity. This is in contrast with our earlier joint effort with Z. Shi [4]; that work shows that the number of zero crossings in the first N-by-N time steps is N to the power (3/2)+o(1) as N goes to infinity. We prove also that the number of zeros on the diagonal in the first N time steps is (c+o(1)) log N as N goes to infinity, where c is 2π.