![](https://d3ilqtpdwi981i.cloudfront.net/ydajbYxv6d5ikez3JdoeE80rjYE=/425x550/smart/https://bepress-attached-resources.s3.amazonaws.com/uploads/44/1d/3c/441d3cc3-fb96-429d-a93f-9db754e4e802/thumbnail_BPFile%20object.jpg)
Unpublished Paper
Structural and Computational Depth of Diffusion Limited Aggregation
Physical Review E
(2004)
Abstract
Diffusion-limited aggregation (DLA) is studied from the perspective of computational complexity. A parallel algorithm is exhibited that requires a number of steps that scales as the depth of the tree defined by the cluster. The existence of this algorithm suggests a connection between a fundamental computational and structural property of DLA.
Disciplines
Publication Date
2004
Comments
Prepublished version downloaded from ArXiv. Published version is located at http://journals.aps.org/pre/abstract/10.1103/PhysRevE.69.051403
Citation Information
D. Tillberg and Jonathan Machta. "Structural and Computational Depth of Diffusion Limited Aggregation" Physical Review E (2004) Available at: http://works.bepress.com/joonathan_machta/39/