Fig. 3.

The average computation times of degree variance normalisations $\overline{v}$, J and ρ of scale-free networks of size 5,000, 10,000, 50,000 and 100,000. Both axes are on log scales. The closed form expression of $\overline{v}$ clearly outperforms J which requires construction of a quasi-star graph in the computation. It also outperforms ρ which employs the construction of the graph Laplacian in its computation