2021/08/20 by L. R. Schwengber, Schwengber, L. R., Sandra D. Prado +3 · 1 citation
Decision Sciences · #Complex Systems and Decision Making #FOS: Physical sciences #Physics and Society (physics.soc-ph) #Statistical Mechanics (cond-mat.stat-mech)
paper · pdf · doi:10.48550/arxiv.2108.09248
openalex publication_date 2021/08/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.