arXiv · 2108.09248
An entropy-based, scale-dependent centrality
Abstract
In this article we introduce an entropy-based, scale-dependent centrality that is evaluated as the Shannon entropy of the distribution at time t of a continuous-time random walk. It ranks nodes as a function of the time t, which acts as a parameter and defines the scale of the network. It is able capture well-known centralities such as degree, eigenvector and closeness depending on the range of t. We compare it with the broad class of total $f$-communicability centralities, of which both Katz centrality and total communicability are particular cases.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
L. R. Schwengber, S. D. Prado, S. R. Dahmen. 2021-08-20. An entropy-based, scale-dependent centrality. https://arxiv.org/abs/2108.09248
Cite the original work for its findings. Save a collection to share your selection of sources.