_{is}{_i )^2
where $\kappa_{is}$ is the number of edges from vertex i to
vertices in module s, and $\kappa_s$ is the degree of vertex
i. $N_M$ equals the number of modules.As discussed in Guimera et al., $P_i = 0$ if vertex i is connected
only to vertices in the same module, and $P_i = 1$ if vertex i is
equally connected to all other modules.
}
[object Object],[object Object]
Guimera, R. and Amaral, L.A.N. (2005) Cartography of complex
networks: modules and universal roles, Journal of Statistical Mechanics:
Theory and Experiment, 02, P02001.