• DocumentCode
    3234126
  • Title

    A New Method for Evaluating Node Importance in Complex Networks Based on Data Field Theory

  • Author

    Le, Lv ; Hewei, Yu

  • Author_Institution
    Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China
  • fYear
    2010
  • fDate
    21-24 Oct. 2010
  • Firstpage
    133
  • Lastpage
    136
  • Abstract
    Estimating of the node importance in complex networks will help us research the core issues of real networks. Evaluating node importance with a single metric is incomplete and limited. This paper proposed a new measure of evaluating node importance. Its basic idea is sequencing the topology potential of node which is based on data field theory and combined with node-degree distribution, and identifying important nodes according to the topological potential. Simulation results of a real network show the feasibility and rationality of the new method.
  • Keywords
    complex networks; network theory (graphs); performance evaluation; complex networks; data field theory; node importance evaluation; node topology; node-degree distribution; Complex networks; Entropy; Mathematical model; Social network services; Topology; Uncertainty; Complex Networks; Data Field; Degree distribution; Node Importance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networking and Distributed Computing (ICNDC), 2010 First International Conference on
  • Conference_Location
    Hangzhou
  • Print_ISBN
    978-1-4244-8382-2
  • Type

    conf

  • DOI
    10.1109/ICNDC.2010.35
  • Filename
    5645414