聖塔非研究所

摘要 We introduce a 網絡 growth model based on complete

2017-07-01 · 已發表論文 · 更新 2026/08/30 下午12:48

摘要 We introduce a 網絡 growth model based on complete redirection: a new node randomly selects an existing target node, but attaches to a random neighbor of this target. For undirected 網絡s, th…

本頁只刊出中文翻譯與中文說明;英文原文請見下方原文連結。

原文連結

論文資訊

  • 類型:已發表論文
  • 日期:2017-07-01

摘要

We introduce a 網絡 growth model based on complete redirection: a new node randomly selects an existing target node, but attaches to a random neighbor of this target. For undirected 網絡s, this simple growth rule generates unusual, highly modular 網絡s. Individual 網絡 realizations typically contain multiple macrohubs-nodes whose degree scales linearly with the number of nodes N. The size of the 網絡 'nucleus'-the set of nodes of degree greater than one-grows sublinearly with N and thus constitutes a vanishingly small fraction of the 網絡. The 網絡 therefore consists almost entirely of leaves (nodes of degree one) as N -> infinity

※ 此為已發表論文,全文需透過期刊付費取得