A new centrality measure based on sub-tree

Lili RONG , Tianzhu GUO , Jiyong ZHANG ,

PDF(251 KB)
PDF(251 KB)
Front. Comput. Sci. ›› 2009, Vol. 3 ›› Issue (3) : 356-360. DOI: 10.1007/s11704-009-0046-y
Research articles

A new centrality measure based on sub-tree

  • Lili RONG , Tianzhu GUO , Jiyong ZHANG ,
Author information +
History +

Abstract

How to evaluate the importance of nodes in networks and detect the centrality has become a vital problem in improving the efficiency of telecommunication and making a disease immunity strategy. We consider the mechanisms of real networks, and define a cost function to describe different hierarchies of networks to measure node importance. This method takes up a node’s regional influence as well as its global influence to evaluate its importance. The results of simulation prove that this method is proper to describe effectively and detect node discrepancies in a network.

Keywords

centrality / compensate function / efficiency / complex networks

Cite this article

Download citation ▾
Lili RONG , Tianzhu GUO , Jiyong ZHANG ,. A new centrality measure based on sub-tree. Front. Comput. Sci., 2009, 3(3): 356‒360 https://doi.org/10.1007/s11704-009-0046-y
AI Summary AI Mindmap
PDF(251 KB)

Accesses

Citations

Detail

Sections
Recommended

/