MiS Preprint Repository
We have decided to discontinue the publication of preprints on our preprint server end of 2024. The publication culture within mathematics has changed so much due to the rise of repositories such as ArXiV (www.arxiv.org) that we are encouraging all institute members to make their preprints available there. An institute's repository in its previous form is, therefore, unnecessary. The preprints published to date will remain available here, but we will not add any new preprints here.
Evolving Networks with distance preferences
Jürgen Jost and Maliackal Poulo JoyAbstract
We study evolving networks where new nodes when attached to the network form links with other nodes of preferred distances. A particular case is where always the shortest distances are selected ("make friends with the friends of your present friends"). We present simulation results for network parameters like the first eigenvalue of the graph Laplacian (synchronizability), clustering coefficients, average distances, and degree distributions for different distance preferences and compare with the parameter values for random and scale free networks. We find that for the shortest distance rule we obtain a power law degree distribution as in scale free networks, while the other parameters are significantly different, especially the clustering coefficient.
- Received:
- 18.02.02
- Published:
- 18.02.02
- PACS:
- 89.75.Da, 89.75.Fb, 89.75.Hc