Structural and computational depth of diffusion-limited aggregation

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 69, Issue 5 2, 2004, Pages

  Tillberg, D ^a   Machta, J ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DIFFUSION; ELECTRODEPOSITION; FLOW OF FLUIDS; FRACTALS; MATHEMATICAL MODELS; MOLECULAR STRUCTURE; POROUS MATERIALS; PROGRAM PROCESSORS; RANDOM ACCESS STORAGE; STATISTICAL METHODS;

ARITHMETIC OPERATIONS; DIFFUSION-LIMITED AGGREGATION (DLA); FRACTAL CLUSTERS; PATTERN FORMATION;

AGGLOMERATION;

EID: 42749103628     PISSN: 15393755     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. T. A. Witten and L. M. Sander, Phys. Rev. Lett. 47, 1400 (1981).
2. F. Barra, B. Davidovitch, and I. Procaccia, Phys. Rev. E 65, 046144 (2002).
3. R. C. Ball and E. Somfai, Phys. Rev. E 67, 021401 (2003).
4. T. Vicsek, Fractal Growth Phenomena (World Scientific, Singapore, 1992).
5. S. Tolman and P. Meakin, Phys. Rev. A 40, 428 (1989).
6. P. Meakin, I. Majid, S. Havlin, and H. E. Stanley, J. Phys. A 17, L975 (1984).
7. C. H. Bennett, in The Universal Turing Machine - A Half-Century Survey, edited by R. Herken (Oxford University Press, New York, 1988), pp. 227-257.
8. C. H. Bennett, in Complexity, Entropy and the Physics of Information, edited by W. H. Zurek, SFI Studies in the Sciences of Complexity Vol. 7 (Addison-Wesley, Reading, MA, 1990), p. 137.
9. C. H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
10. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo, Limits to Parallel Computation: P-completeness Theory (Oxford University Press, New York, 1995).
11. J. Machta and X.-N. Li, Physica A 300, 245 (2001).
12. C. Moore and J. Machta, J. Stat. Phys. 99, 661 (2000).
13. J. Machta and R. Greenlaw, J. Stat. Phys. 77, 755 (1994).
14. J. Machta and R. Greenlaw, J. Stat. Phys. 82, 1299 (1996).
15. K. Moriarty, J. Machta, and R. Greenlaw, Phys. Rev. E 55, 6211 (1997).
16. A. Gibbons and W. Rytter, Efficient Parallel Algorithms (Cambridge University Press, Cambridge, England 1988).
17. 3.
18. Random walk trajectories may include several restarts from the birth circle each time the death circle is reached.