ComputingComputer ScienceComplex SystemsComputer NetworksGraph VisualizationGraph AlgorithmsNetwork AnalysisNetwork CentralityNetwork StructureNetwork TheoryAlgorithm Performance EvaluationCentralityComplex Network AnalysisComplex Network TheoryComplex NetworksImportance MeasuresNode CentralityNode Degree
To improve the efficiency and validity of node importance evaluating,a new evaluation method for node importance in complex networks was proposed based on node closeness and node key degree in its neighborhood. In this method,the global importance and the local importance of nodes are combined. The basic thought of the method is that the bigger the closeness of a node is,the closer to center of a complex network the node is and the more important it is; the bigger the key degree of a node in its neighborhood is,the more important in the neighborhood the node is. An evaluation algorithm corresponding to the method was designed. This algorithm has a time complexity of O(n3). Finally,the validity of the proposed method was verified by experiments.