Table of Contents
Fetching ...

Capacity of the range of random walk: The law of the iterated logarithm

Amir Dembo, Izumi Okada

Abstract

We establish both the $\limsup$ and the $\liminf$ law of the iterated logarithm (LIL), for the capacity of the range of a simple random walk in any dimension $d\ge 3$. While for $d \ge 4$, the order of growth in $n$ of such LIL at dimension $d$ matches that for the volume of the random walk range in dimension $d-2$, somewhat surprisingly this correspondence breaks down for the capacity of the range at $d=3$. We further establish such LIL for the Brownian capacity of a $3$-dimensional Brownian sample path and novel, sharp moderate deviations bounds for the capacity of the range of a $4$-dimensional simple random walk.

Capacity of the range of random walk: The law of the iterated logarithm

Abstract

We establish both the and the law of the iterated logarithm (LIL), for the capacity of the range of a simple random walk in any dimension . While for , the order of growth in of such LIL at dimension matches that for the volume of the random walk range in dimension , somewhat surprisingly this correspondence breaks down for the capacity of the range at . We further establish such LIL for the Brownian capacity of a -dimensional Brownian sample path and novel, sharp moderate deviations bounds for the capacity of the range of a -dimensional simple random walk.
Paper Structure (13 sections, 22 theorems, 266 equations)