Table 4 Computing times for edge \({\mathbf {z}}\)-scores and singleton \({\mathbf {z}}\)-scores, on organisms and Pokec networks. For each network we report the number of nodes, the number of edges and the sum of squared degrees. The complexity of singleton \({\mathbf {z}}\)-scores computation strongly depends on the sum of squared degrees.

From: A novel method for assessing and measuring homophily in networks through second-order statistics