本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2002
摘要
We study evolving 網絡s where new nodes when attached to the 網絡 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 網絡 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 無標度 網絡s. We find that for the shortest distance rule we obtain a power-law degree distribution as in 無標度 網絡s, while the other parameters are significantly different, especially the clustering coefficient.
※ 此為已發表論文，全文需透過期刊付費取得