摘要 A number of recent studies have focused on the 統計

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

原文連結

• SFI 頁面

論文資訊

• 類型：已發表論文
• 日期：2002

摘要

A number of recent studies have focused on the 統計 properties of 網絡ed systems such as 社會 網絡s and the Worldwide Web. Researchers have concentrated particularly on a few properties that seem to be common to many 網絡s: the small-world property, power-law degree distributions, and 網絡 transitivity. In this article, we highlight another property that is found in many 網絡s, the property of community structure, in which 網絡 nodes are joined together in tightly knit groups, between which there are only looser connections. We propose a method for detecting such communities, built around the idea of using centrality indices to find community boundaries. We test our method on computer-generated and real-world graphs whose community structure is already known and find that the method detects this known str

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