Hierarchy Measure for Complex Networks
نویسندگان
چکیده
منابع مشابه
Hierarchy Measure for Complex Networks
Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above u...
متن کاملHierarchy measures in complex networks.
Using each node's degree as a proxy for its importance, the topological hierarchy of a complex network is introduced and quantified. We propose a simple dynamical process used to construct networks which are either maximally or minimally hierarchical. Comparison with these extremal cases as well as with random scale-free networks allows us to better understand hierarchical versus modular featur...
متن کاملSpectral Measure of Robustness in Complex Networks
Jun Wu, 2, 3, ∗ Yue-Jin Tan, Hong-Zhong Deng, Yong Li, Bin Liu, and Xin Lv College of Information Systems and Management, National University of Defense Technology, Changsha 410073, P. R. China. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, P. R. China Institute for Mathematical Sciences, Imperial College London, London SW7 2PG, United Kingdom (Dated: February ...
متن کاملAn Activation Force-based Affinity Measure for Analyzing Complex Networks
Affinity measure is a key factor that determines the quality of the analysis of a complex network. Here, we introduce a type of statistics, activation forces, to weight the links of a complex network and thereby develop a desired affinity measure. We show that the approach is superior in facilitating the analysis through experiments on a large-scale word network and a protein-protein interactio...
متن کاملHierarchical Decomposition for Betweenness Centrality Measure of Complex Networks
Betweenness centrality is an indicator of a node's centrality in a network. It is equal to the number of shortest paths from all vertices to all others that pass through that node. Most of real-world large networks display a hierarchical community structure, and their betweenness computation possesses rather high complexity. Here we propose a new hierarchical decomposition approach to speed up ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2012
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0033799