Topology of the Support of the Two-Dimensional Lattice Random Walk

Abstract
The average number I(t) of islands (connected sets of unvisited sites) enclosed by the support of a 2D simple random walk is studied for a large number t of steps. On an infinite square lattice the result I(t)12π(π2)t/ln28t is the difference between a creation and a destruction term that are both t/ln8t. On a finite lattice of N sites, for N large, I(t) attains a maximum value [(π2)/2e]N/lnN for tπ1NlnN, and goes down to O(1) for tπ1Nln2N. The scaling function describing this behavior is given and compared with simulations by Coutinho et al.

This publication has 17 references indexed in Scilit: