本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2011
摘要
To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation, which reveals multilevel structures in 網絡s. In this 資訊-theoretic approach, we exploit the duality between compression and pattern detection; by compressing a description of a random walker as a proxy for real flow on a 網絡, we find regularities in the 網絡 that induce this system-wide flow. Finding the shortest multilevel description of the random walker therefore gives us the best hierarchical clustering of the 網絡 - the optimal number of levels and modular partition at each level - with respect to the dynamics on the 網絡. With a novel search algorithm, we extract and illustrate the rich multilevel organization of several large 社會 and 生物 網絡s. For example, from the global air tra
※ 此為已發表論文，全文需透過期刊付費取得