本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2002
摘要
We describe some new exactly solvable models of the structure of 社會 網絡s, based on 隨機圖s with arbitrary degree distributions. We give models both for simple unipartite 網絡s, such as acquaintance 網絡s, and bipartite 網絡s, such as affiliation 網絡s. We compare the predictions of our models to data for a number of real-world 社會 網絡s and find that in some cases, the models are in remarkable agreement with the data, whereas in others the agreement is poorer, perhaps indicating the presence of additional 社會 structure in the 網絡 that is not captured by the 隨機圖.
※ 此為已發表論文，全文需透過期刊付費取得