Classical diffusion on eden trees

Abstract

We study an aggregation process which gives rise to compact clusters with no loops. A generalization of the node-counting theorem, applicable to such branched graphs (trees), is proved. This is used to determine the spectral dimension of these clusters on square and cubic embedding lattices by Monte Carlo simulations. The results are explained in terms of the geometric structure of these trees.