A new structural entropy measurement of networks based on the nonextensive statistical mechanics and hub repulsion
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...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
AIMS Press
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/c63bba5d7bba4b2d831ac749f9afb6dc |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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. |
|---|