本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2017-01-17
摘要
The giant k-core-maximal connected subgraph of a 網絡 where each node has at least k neighbors-is important in the study of 相變s and in applications of 網絡 theory. Unlike Erdos-Renyi graphs and other random 網絡s where k-cores emerge discontinuously for k >= 3, we show that transitive linking (or triadic closure) leads to 3-cores emerging through single or double 相變s of both discontinuous and continuous nature. We also develop a k-core calculation that includes clustering and provides insights into how high-level connectivity emerges.
※ 此為已發表論文，全文需透過期刊付費取得