Counting Planar Random Walk Holes


We study two variants of the notion of holes formed by planar simple random walk of time duration 2n and the areas associated with them. We prove in both cases that the number of holes of area greater than A(n), where {A(n)} is an increasing sequence, is, up to a logarithmic correction term, asymptotic to n · A(n) for a range of large holes, thus confirming… (More)


5 Figures and Tables

Slides referencing similar topics