本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2009
摘要
We offer a solution to a long-standing problem in the theory of 網絡s, the creation of a plausible, solvable model of a 網絡 that displays clustering or transitivity-the propensity for two neighbors of a 網絡 node also to be neighbors of one another. We show how standard random-graph models can be generalized to incorporate clustering and give exact solutions for various properties of the resulting 網絡s, including sizes of 網絡 components, size of the giant component if there is one, position of the 相變 at which the giant component forms, and position of the 相變 for 滲流 on the 網絡.
※ 此為已發表論文，全文需透過期刊付費取得