Structural and computational depth of diffusion limited aggregation

TL;DR

This paper explores the computational complexity of diffusion limited aggregation (DLA), revealing a parallel algorithm whose steps scale with the cluster's structural depth, indicating a link between DLA's structure and computation.

Contribution

It introduces a parallel algorithm for DLA whose complexity scales with the cluster's depth, highlighting a connection between structural and computational properties.

Findings

Parallel algorithm scales with cluster depth

Connection between DLA structure and computational complexity

Potential implications for understanding DLA behavior

Abstract

Diffusion limited aggregation 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.