The search functionality is under construction.

Author Search Result

[Author] Xin-Feng LI(2hit)

1-2hit
  • How Centrality of Driver Nodes Affects Controllability of Complex Networks

    Guang-Hua SONG  Xin-Feng LI  Zhe-Ming LU  

     
    PAPER-Artificial Intelligence, Data Mining

      Pubricized:
    2021/05/20
      Vol:
    E104-D No:8
      Page(s):
    1340-1348

    Recently, the controllability of complex networks has become a hot topic in the field of network science, where the driver nodes play a key and central role. Therefore, studying their structural characteristics is of great significance to understand the underlying mechanism of network controllability. In this paper, we systematically investigate the nodal centrality of driver nodes in controlling complex networks, we find that the driver nodes tend to be low in-degree but high out-degree nodes, and most of driver nodes tend to have low betweenness centrality but relatively high closeness centrality. We also find that the tendencies of driver nodes towards eigenvector centrality and Katz centrality show very similar behaviors, both high eigenvector centrality and high Katz centrality are avoided by driver nodes. Finally, we find that the driver nodes towards PageRank centrality demonstrate a polarized distribution, i.e., the vast majority of driver nodes tend to be low PageRank nodes whereas only few driver nodes tend to be high PageRank nodes.

  • The Controllability of Power Grids in Comparison with Classical Complex Network Models

    Yi-Jia ZHANG  Zhong-Jian KANG  Xin-Feng LI  Zhe-Ming LU  

     
    LETTER-Artificial Intelligence, Data Mining

      Pubricized:
    2015/10/20
      Vol:
    E99-D No:1
      Page(s):
    279-282

    The controllability of complex networks has attracted increasing attention within various scientific fields. Many power grids are complex networks with some common topological characteristics such as small-world and scale-free features. This Letter investigate the controllability of some real power grids in comparison with classical complex network models with the same number of nodes. Several conclusions are drawn after detailed analyses using several real power grids together with Erdös-Rényi (ER) random networks, Wattz-Strogatz (WS) small-world networks, Barabási-Albert (BA) scale-free networks and configuration model (CM) networks. The main conclusion is that most driver nodes of power grids are hub-free nodes with low nodal degree values of 1 or 2. The controllability of power grids is determined by degree distribution and heterogeneity, and power grids are harder to control than WS networks and CM networks while easier than BA networks. Some power grids are relatively difficult to control because they require a far higher ratio of driver nodes than ER networks, while other power grids are easier to control for they require a driver node ratio less than or equal to ER random networks.