Fig. 5

Consistency of asymmetric saturation time in ER graphs with varying size and density. A We observe that as the graph becomes denser, less fraction of graph instances incur the asymmetric behavior in saturation time (saturation time distribution having skewness \(\ge 1.0\)). However, we consistently find instances of ER network with the observed asymmetric behaviour even in high average degree regime. For each average degree, We generated 100 ER graph instances with 1,000 nodes and ran 100 realizations of deterministic random walks to obtain the skewness of the saturation time. B Along with changing the average degree, we now vary the number of nodes. We observe consistent behavior regarding asymmetric saturation time across different numbers of nodes