Abstract
Let each of n particles starting at the origin in Z^2 perform simple random walk until reaching a site with no other particles. Lawler, Bramson, and Griffeath proved that the resulting random set A(n) of n occupied sites is (with high probability) close to a disk B_r of radius r=\sqrt{n/π}. We show that the discrepancy between A(n) and the disk is at most logarithmic in the radius: i.e., there is an absolute constant C such that the following holds with probability one: B_{r - C \log r} \subset A(πr^2) \subset B_{r+ C \log r} for all sufficiently large r.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.