Answers are grounded in this paper and cite their sources.
Simple conditions are presented under which the fractal dimension of a random walk on an aggregate, dw, is given by dw=D+1, where D is the aggregate's fractal dimension. These conditions are argued (with one simple speculative assumption) to apply for $D<2$, implying a breakdown of the Alexander-Orbach rule dw=3D/2. Existing results for percolation clusters, lattice animals, and diffusion-limited aggregates seem to favor our new rule.
No takes yet. Share an insight, caveat, or question.
Aharony et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: