Table 2.

Traits of degree heterogeneity among proposed normalisations

		Defined for	Computational	Complements	Value for	Value for	Value for
Metric	Normalised	all networks	efficiency	have equal values	star graph	regular graph	random graph
v	No	Yes	High	Yes	→∞ as n→∞	0	(n−1)p(1−p)
$\overline{v}$	Yes	Yes	High	Yes	→1 as n→∞	0	≈2/n
σ2(Zimmermann et al. 2004)	No	Yes	High	No	→∞ as n→∞	0	depends on n and p
J(Snijders 1981)	No	Yes	Low	No	1	0	depends on n and p
ρ(Estrada 2010)	Yes	No	Moderate	No	1	0	depends on n and p