Local network evolution rules drive shortest path multiplicity
Abstract: The shortest path multiplicity is an important metric of complex networks. The shortest path multiplicity of real networks is high and it correlates with their 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.