Level crossings of a two-parameter random walk
We prove that the number Z(N) of level crossings of a two-parameter simple random walk in its first NxN steps is almost surely N3/2+o(1) as N-->[infinity]. The main ingredient is a strong approximation of Z(N) by the crossing local time of a Brownian sheet. Our result provides a useful algorithm for simulating the level sets of the Brownian sheet.
Year of publication: |
2005
|
---|---|
Authors: | Khoshnevisan, Davar ; Révész, Pál ; Shi, Zhan |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 115.2005, 3, p. 359-380
|
Publisher: |
Elsevier |
Keywords: | Level crossing Local time Random walk Brownian sheet |
Saved in:
Saved in favorites
Similar items by person
-
Boundary crossings and the distribution function of the maximum of Brownian sheet
Csáki, Endre, (2000)
-
Strong approximation of spatial random walk in random scenery
Révész, Pál, (2000)
-
Large void zones and occupation times for coalescing random walks
Csáki, Endre, (2004)
- More ...