Figure 4
From: Scaling of average receiving time on weighted polymer networks with some topological properties
The average weighted shortest path. Plot of the renormalized average weighted shortest path \(\tilde{{d}_{g}}\) versus the iteration g, where \(\tilde{{d}_{g}}=\frac{\overline{{d}_{g}}-\,\min \,\{\overline{{d}_{g}}\}}{\max \,\{\overline{{d}_{g}}\}-\,\min \,\{\overline{{d}_{g}}\}}\).
