Figure 3
From: Volume explored by a branching random walk on general graphs
Probability distribution of the number of visited sites, (a) for regular lattices of dimensions d = 1, 2, 3 and 5, and for (b) Sierpinski carpet, random tree, and a preferential attachment (scale-free) networks. The solid black lines represent the predicted scaling given by Eq. (4). Simulations parameters: H = 0.1, s = e = 0.45, ε′ = 0, and γ → ∞.
