Figure 4.

(a) Neighborhood of the red node consists of the set of green nodes. We connect the red node with each of the green nodes in its neighborhood with a probability $p_c$. We do this by generating a random number between $0$ and $1$ for each of the green nodes and check if this random number is less than $p_c$. If this is the case, then the red node and the green node are connected, otherwise they are not connected. (b) An example of a small cellular graph with $p_c=0.35$. (c) $MSD(p_c,p_B)$ versus $p_c$ diagram, for different values of $p_B$ (the probability of a particle to reach a neighbor node by Brownian motion.