Skip to main content
Fig. 4 | Applied Network Science

Fig. 4

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

Fig. 4

Observing asymmetric saturation time in ER graphs. A Initially, we observed a wider upper bound of saturation time over 100 simulations in case of an ER and a BA graph (both with 1000 nodes and 6 average degree). This observation is consistent over different diffusion probabilities. B To quantify the level of occurrence of this asymmetric behaviour, we studied the skewness of the distribution of saturation time for the ER and BA models. Considering a high skewness threshold of 1.0, which is the upper-bound of skewness for BA graphs, we observed that the asymmetric saturation time occurred in 58% of the ER graphs. The distributions are generated through simulations over 100 instances of ER and BA graphs (each with 1000 nodes and average degree of 6) by distributing 10,000 walkers evenly on 4 randomly selected nodes and repeating this process 100 times for each graph

Back to article page