Strong Spherical Asymptotics for Rotor-Router Aggregation and the Divisible Sandpile

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

[v3] Added Theorem 4.1, which generalizes Theorem 1.4 for the abelian sandpile. [v4] Added references and improved exposition

Scientific paper

10.1007/s11118-008-9104-6

The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We prove that the asymptotic shape of this model is a Euclidean ball, in a sense which is stronger than our earlier work. For the shape consisting of $n=\omega_d r^d$ sites, where $\omega_d$ is the volume of the unit ball in $\R^d$, we show that the inradius of the set of occupied sites is at least $r-O(\log r)$, while the outradius is at most $r+O(r^\alpha)$ for any $\alpha > 1-1/d$. For a related model, the divisible sandpile, we show that the domain of occupied sites is a Euclidean ball with error in the radius a constant independent of the total mass. For the classical abelian sandpile model in two dimensions, with $n=\pi r^2$ particles, we show that the inradius is at least $r/\sqrt{3}$, and the outradius is at most $(r+o(r))/\sqrt{2}$. This improves on bounds of Le Borgne and Rossin. Similar bounds apply in higher dimensions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Strong Spherical Asymptotics for Rotor-Router Aggregation and the Divisible Sandpile does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Strong Spherical Asymptotics for Rotor-Router Aggregation and the Divisible Sandpile, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strong Spherical Asymptotics for Rotor-Router Aggregation and the Divisible Sandpile will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-293010

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.