{'fraction_non_alphanumeric': 0.03130148270181219, 'fraction_numerical': 0.006589785831960461, 'mean_word_length': 4.28695652173913, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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) -1 for a range of large holes, thus confirming an observation by Mandelbrot. A consequence is that the largest hole has an area which is logarithmically asymptotic to n. We also discuss the different exponent of 5/3 observed by Mandelbrot for small holes.