4.5 Article

A new structural entropy measurement of networks based on the nonextensive statistical mechanics and hub repulsion

期刊

MATHEMATICAL BIOSCIENCES AND ENGINEERING
卷 18, 期 6, 页码 9253-9263

出版社

AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/mbe.2021455

关键词

complex networks; structure entropy; coulomb's law; tsallis nonextensive statistical mechanics

向作者/读者索取更多资源

This paper investigates a new method for structural entropy of complex networks, which synthesizes the influence of repulsive force and betweenness, providing a more reasonable description of the structural properties of complex networks and showing better discrimination in irregular networks. Experiments on various networks confirm the effectiveness of the new method.
The structure properties of complex networks are an open issue. As the most important parameter to describe the structural properties of the complex network, the structure entropy has attracted much attention. Recently, the researchers note that hub repulsion plays an role in structural entropy. In this paper, the repulsion between nodes in complex networks is simulated when calculating the structure entropy of the complex network. Coulomb's law is used to quantitatively express the repulsive force between two nodes of the complex network, and a new structural entropy based on the Tsallis nonextensive statistical mechanics is proposed. The new structure entropy synthesizes the influence of repulsive force and betweenness. We study several construction networks and some real complex networks, the results show that the proposed structure entropy can describe the structural properties of complex networks more reasonably. In particular, the new structural entropy has better discrimination in describing the complexity of the irregular network. Because in the irregular network, the difference of the new structure entropy is larger than that of degree structure entropy, betweenness structure entropy and Zhang's structure entropy. It shows that the new method has better discrimination for irregular networks, and experiments on Graph, Centrality literature, US Aire lines and Yeast networks confirm this conclusion.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据