Distance Entropy Cartography Characterises Centrality in Complex Networks
We introduce distance entropy as a measure of homogeneity in the distribution of path lengths between a given node and its neighbours in a complex network. Distance entropy defines a new centrality measure whose properties are investigated for a variety of synthetic network models. By coupling dista...
Main Authors: | Massimo Stella, Manlio De Domenico |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-04-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/20/4/268 |
Similar Items
-
How to Identify the Most Powerful Node in Complex Networks? A Novel Entropy Centrality Approach
by: Tong Qiao, et al.
Published: (2017-11-01) -
Viability in Multiplex Lexical Networks and Machine Learning Characterizes Human Creativity
by: Massimo Stella, et al.
Published: (2019-07-01) -
A Survey of Information Entropy Metrics for Complex Networks
by: Yamila M. Omar, et al.
Published: (2020-12-01) -
Viability in multiplex lexical networks and machine learning characterizes human creativity
by: Kenett, Y.N, et al.
Published: (2019) -
A Novel Entropy-Based Centrality Approach for Identifying Vital Nodes in Weighted Networks
by: Tong Qiao, et al.
Published: (2018-04-01)