A centrality measure for quantifying spread on weighted, directed networks

Christian G. Fink,Kelly Fullin, Guillermo Gutierrez,Nathan Omodt, Sydney Zinnecker,Gina Sprint, Sean Mcculloch

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS(2023)

引用 2|浏览7
暂无评分
摘要
While many centrality measures for complex networks have been proposed, relatively few have been developed specifically for weighted, directed (WD) networks. Here we propose a centrality measure (Viral Centrality) for spread (of information, pathogens, etc.) through WD networks based on the independent cascade model (ICM). While calculating the most accurate results for the ICM generally requires Monte Carlo simulations, we show that Viral Centrality provides excellent approximation to ICM results for networks in which the weighted strength of cycles is not too large. We show this can be quantified with the leading eigenvalue of the weighted adjacency matrix, and we show that Viral Centrality outperforms other common centrality measures in both simulated and empirical WD networks. A Python implementation of the Viral Centrality algorithm has been made available at the Stanford Network Analysis Project repository. (c) 2023 Elsevier B.V. All rights reserved.
更多
查看译文
关键词
Network centrality,Weighted directed network,Independent cascade model (ICM),Susceptible infected recovered (SIR) model
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要