Systems Engineering and Electronics

Previous Articles     Next Articles

Time-varying complex network layout algorithm based on node centrality

ZHOU Xian1,2,3, LIANG Xiao1,2, HUANG Tinglei1,2   

  1. 1. Institute of Electronics, Chinese Academy of Sciences, Beijing 100190, China; 2. Key Laboratory of
    Technology in GeoSpatial Information Processing and Application System, Chinese Academy of
    Sciences, Beijing 100190, China; 3. University of Chinese Academy of Sciences, Beijing 100049, China
  • Online:2017-09-27 Published:2010-01-03

Abstract:

The current time-varying network layout algorithm mainly preserves the mental graph from the network structure and the aesthetic quality, without considering the influence of the node centrality. The force-directed algorithm to the time-varying network layout algorithm by embeding node centrality is improved. Firstly, the PageRank algorithm is used to evaluate the centrality of the nodes by referring to semi-local centrality. Then, the dynamic range is calculated as the constraint factor of nodes according to its centrality and stability. Finally, the time-varying network layout algorithm based on node centrality is formed by the static force-directed algorithm via the constraint of the dynamic range. The experimental results show that the proposed approach can balance the mental map and aesthetic quality, and also own good computational capability for large time-varying networks.

[an error occurred while processing this directive]