科研之友
微信
新浪微博
Facebook
分享链接
摘要
The study of community structure is a primary focus of network analysis, which has attracted a large amount of attention. In this paper, we focus on two famous functions, i.e., the Hamiltonian function H and the modularity density measure D, and intend to uncover the effective thresholds of their corresponding resolution parameter 7 without resolution limit problem. Two widely used example networks are employed, including the ring network of lumps as well as the ad hoc network. In these two networks, we use discrete convex analysis to study the interval of resolution parameter of H and D that will not cause the misidentification. By comparison, we find that in both examples, for Hamiltonian function H, the larger the value of resolution parameter gamma, the less resolution limit the network suffers; while for modularity density D, the less resolution limit the network suffers when we decrease the value of gamma. Our framework is mathematically strict and efficient and can be applied in a lot of scientific fields.
- 出版日期2017-3-10
- 单位中国人民解放军国防科学技术大学; 中央财经大学
