Link Influence Entropy
详细信息 查看全文
- 作者：Priti Singh priti@isac.gov.in" class="auth_mail" title="E-mail the corresponding author ; Abhishek Chakraborty abhishek2003slg@ieee.org" class="auth_mail" title="E-mail the corresponding author ; B.S. Manoj ; bsmanoj@ieee.org" class="auth_mail" title="E-mail the corresponding author
- 关键词：Complex networks ; Network entropy ; Average path length ; LInE ; Influence stability ; Wireless mesh networks
- 刊名：Physica A: Statistical Mechanics and its Applications
- 出版年：2017
- 出版时间：1 January 2017
- 年：2017
- 卷：465
- 期：Complete
- 页码：701-713
- 全文大小：997 K
文摘
- •
We propose a new metric, Link Influence Entropy (LInE), that can capture link/node influences and influence stability of nodes in a network.
- •
LInE can identify nodal importance based on link influence which degree based centrality or betweenness centrality cannot differentiate.
- •
It is found that spatial wireless networks and regular grid networks, respectively, demonstrate the lowest and highest LInE values.
- •
LInE has been extensively studied on various example real-world and arbitrary networks and proved its novelty.
- •
Usefulness of LInE is highlighted in estimating the influence stability of nodes in a dynamic network.