本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2014-04-17
摘要
We investigate choice-driven 網絡 growth. In this model, nodes are added one by one according to the following procedure: for each addition event a set of target nodes is selected, each according to linear preferential attachment, and a new node attaches to the target with the highest degree. Depending on precise details of the attachment rule, the resulting 網絡s have three possible outcomes: (i) a non-universal power-law degree distribution; (ii) a single macroscopic hub (a node whose degree is of the order of N, the number of 網絡 nodes), while the remainder of the nodes comprise a non-universal power-law degree distribution ;(iii) a degree distribution that decays as (k ln k)(-2) at the transition between cases (i) and (ii). These properties are robust when attachment occurs to the highest d
※ 此為已發表論文，全文需透過期刊付費取得