2002/02/28 by Jürgen Jost, J. Jost, M. P. Joy · 2 citations
Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Opinion Dynamics and Social Influence #Stochastic processes and statistical mechanics #cond-mat.dis-nn #cond-mat.stat-mech
paper · pdf · doi:10.1103/physreve.66.036126
published as Phys. Rev. E 66, 036126 (2002) · REVTEX Format, 6 Pages, 6 Figures, 1 Table; References added and Revised
arxiv created 2002/07/15 · openalex publication_date 2002/09/24 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 them 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.