Test of multiscaling in DLA model using an off-lattice killing-free algorithm
arXiv:cond-mat/0504338 · doi:10.1103/PhysRevE.73.011407
Abstract
We test the multiscaling issue of DLA clusters using a modified algorithm. This algorithm eliminates killing the particles at the death circle. Instead, we return them to the birth circle at a random relative angle taken from the evaluated distribution. In addition, we use a two-level hierarchical memory model that allows using large steps in conjunction with an off-lattice realization of the model. Our algorithm still seems to stay in the framework of the original DLA model. We present an accurate estimate of the fractal dimensions based on the data for a hundred clusters with 50 million particles each. We find that multiscaling cannot be ruled out. We also find that the fractal dimension is a weak self-averaging quantity. In addition, the fractal dimension, if calculated using the harmonic measure, is a nonmonotonic function of the cluster radius. We argue that the controversies in the data interpretation can be due to the weak self-averaging and the influence of intrinsic noise.
8 pages, 9 figures
References in corpus (2)
Cited by in corpus (10)
- Conformal approach to cylindrical DLA
- Finite size effect of harmonic measure estimation in a DLA model: Variable size of probe particles
- Morphological diagram of diffusion driven aggregate growth in plane: competition of anisotropy and adhesion
- Variable size particle probing of the DLA cluster properties
- Diffusion-limited aggregation with polygon particles
- Scaling and Multiscaling Behavior of the Perimeter of Diffusion-Limited Aggregation (DLA) Generated by the Hastings-Levitov Method
- Variable-step-length algorithms for a random walk: hitting probability and computation performance
- Probability of stochastic processes and spacetime geometry
- Analysis of patterns formed by two-component diffusion limited aggregation
- Influence of the random walk finite step on the first-passage probability