本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2000
摘要
The small-world 網絡 model is a simple model of the structure of 社會 網絡s, which possesses characteristics of both regular lattices and 隨機圖s. The model consists of a one-dimensional lattice with a low density of shortcuts added between randomly selected pairs of points. These shortcuts greatly reduce the typical path length between any two points on the lattice. We present a mean-field solution for the average path length and for the distribution of path lengths in the model. This solution is exact in the limit of large system size and either a large or small number of shortcuts.
※ 此為已發表論文，全文需透過期刊付費取得