复杂网络中节点重要度评估_陈静.pdf

44 3 Vo.l 44 No. 3 2009 6 JOURNAL OF SOUTHW EST JIAOTONG UN IVERSITY Jun. 2009 : 0258-2724( 2009) 03-0426-04 DO I: 0. 3969/j. issn. 0258-2724. 2009. 03. 02 陈 静, 孙林夫 ( CAD, 6 003 ) : , . , , , , ; , . , O ( n3 ). . : ; ; ; ; ; : O233 : A Evaluation of Node Importance in Complex Networks CH EN J ing, SUN L inf u ( CAD Engineering Cen ter, Southw est JiaotongUn ivers ity, Chengdu 6 003 , Ch ina) Abstract: To mi prove the efficiency and valid ity of node mi portance evaluating, a new evaluation method for node mi portance in complex networksw as proposed based on node closeness and node key degree in its neighborhood. In th is method, the global mi portance and the local mi portance of nodes are comb ined. The basic thought of them ethod is that the b igger the closeness of a node is, the closer to center of a comp lex newt ork the node is and themore mi portant it is; the bigger the key degree of a node in its neighborhood is, the more mi portant in the neighborhood the node is. An evaluation 3 algorithm corresponding to themethod w as designed. This algorithm has a tmi e complexity ofO ( n ). F inally, the valid ity of the proposedm ethod w as verified by expermi ents. K ey words: complex netw ork; node mi portance; closeness; neighborhood; key field; key degree , , , . , , [ ~ 3] , . , [ 4~ 6] , , , . , , , . , . / 0, / 0. [ 7] , . ( [ 8] ) , . : 2008-