Mathematics – Probability
Scientific paper
2007-01-07
Mathematics
Probability
1 figure
Scientific paper
10.1007/s00220-008-0424-6
We consider the DLA process on a cylinder G x N. It is shown that this process "grows arms", provided that the base graph G has small enough mixing time. Specifically, if the mixing time of G is at most (log|G|)^(2-\eps), the time it takes the cluster to reach the m-th layer of the cylinder is at most of order m |G|/loglog|G|. In particular we get examples of infinite Cayley graphs of degree 5, for which the DLA cluster on these graphs has arbitrarily small density. In addition, we provide an upper bound on the rate at which the "arms" grow. This bound is valid for a large class of base graphs G, including discrete tori of dimension at least 3. It is also shown that for any base graph G, the density of the DLA process on a G-cylinder is related to the rate at which the arms of the cluster grow. This implies, that for any vertex transitive G, the density of DLA on a G-cylinder is bounded by 2/3.
Benjamini Itai
Yadin Ariel
No associations
LandOfFree
Diffusion Limited Aggregation on a Cylinder 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 Diffusion Limited Aggregation on a Cylinder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Diffusion Limited Aggregation on a Cylinder will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-370208