Directed Network Comparison Using Motifs

被引:0
作者
Xie, Chenwei [1 ]
Ke, Qiao [1 ]
Chen, Haoyu [1 ]
Liu, Chuang [1 ]
Zhan, Xiu-Xiu [1 ,2 ]
机构
[1] Hangzhou Normal Univ, Res Ctr Complex Sci, Hangzhou 311121, Peoples R China
[2] Zhejiang Univ, Coll Media & Int Culture, Hangzhou 310027, Peoples R China
关键词
network comparison; motifs; Jensen-Shannon divergence; directed networks;
D O I
10.3390/e26020128
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Analyzing and characterizing the differences between networks is a fundamental and challenging problem in network science. Most previous network comparison methods that rely on topological properties have been restricted to measuring differences between two undirected networks. However, many networks, such as biological networks, social networks, and transportation networks, exhibit inherent directionality and higher-order attributes that should not be ignored when comparing networks. Therefore, we propose a motif-based directed network comparison method that captures local, global, and higher-order differences between two directed networks. Specifically, we first construct a motif distribution vector for each node, which captures the information of a node's involvement in different directed motifs. Then, the dissimilarity between two directed networks is defined on the basis of a matrix, which is composed of the motif distribution vector of every node and the Jensen-Shannon divergence. The performance of our method is evaluated via the comparison of six real directed networks with their null models, as well as their perturbed networks based on edge perturbation. Our method is superior to the state-of-the-art baselines and is robust with different parameter settings.
引用
收藏
页数:11
相关论文
共 42 条
  • [1] [Anonymous], 2013, P 2013 SIAM INT C DA, DOI DOI 10.1137/1.9781611972832.18
  • [2] Graph Isomorphism in Quasipolynomial Time [Extended Abstract]
    Babai, Laszlo
    [J]. STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 684 - 697
  • [3] An information-theoretic, all-scales approach to comparing networks
    Bagrow, James P.
    Bollt, Erik M.
    [J]. APPLIED NETWORK SCIENCE, 2019, 4 (01)
  • [4] Network science
    Barabasi, Albert-Laszlo
    [J]. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2013, 371 (1987):
  • [5] Higher-order organization of complex networks
    Benson, Austin R.
    Gleich, David F.
    Leskovec, Jure
    [J]. SCIENCE, 2016, 353 (6295) : 163 - 166
  • [6] Bretto A, 2013, An introduction mathematical engineering, DOI DOI 10.1007/978-3-319-00080-0
  • [7] Cohen E., 2013, COSN, P131
  • [8] THE DIFFUSION OF AN INNOVATION AMONG PHYSICIANS
    COLEMAN, J
    KATZ, E
    MENZEL, H
    [J]. SOCIOMETRY, 1957, 20 (04): : 253 - 270
  • [9] Thirty years of graph matching in pattern recognition
    Conte, D
    Foggia, P
    Sansone, C
    Vento, M
    [J]. INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2004, 18 (03) : 265 - 298
  • [10] Coo23 Cook S.A., 2023, Logic, automata, and computational complexity: The works of Stephen A. Cook, P143