Local network evolution rules drive shortest path multiplicity

Abstract

The shortest path multiplicity, here denoted by $μ$, is an important metric of complex networks. For real networks $μ$ is high and it correlates with the network community structure. Since local network evolution induces network communities, it is possible that a high shortest path multiplicity is the natural expectation of local evolution rules. Here I demonstrate, by means of numerical simulations, that this is indeed the case. For random graphs with arbitrary degree distributions $p_k$, $\langleμ\rangle\sim \langle k(k-1\rangle / \langle k\rangle e$, growing with the network size when $p_k\sim k^{-γ}$ and $γ\leq3$. For networks generated by local rules, $\langleμ\rangle$ increases with increasing the network size and it does faster than what observed in their randomized versions. Furthermore, the number of communities increases with the network size and the correlation with $\langle μ\rangle$ follows.