Skip to main content
Applied Network Science
Fig. 1 | Applied Network Science

Fig. 1

From: Deterministic random walk model in NetLogo and the identification of asymmetric saturation time in random graph

Fig. 1

Deterministic random walk. p is the diffusion rate of the walkers. The blue node contains n walkers and has d neighbors at a certain instance of simulation. In this model, \(n\times p\) walkers leave the blue node on an average and all its (green nodes) neighbors get \(\frac{n\times p}{d}\) walkers from this node. In the meantime, some walkers are coming to the blue node from its (green nodes) neighbors using the same logic

Back to article page