Structural information content of networks: Graph entropy based on local vertex functionals

被引：29
|
作者：
Dehmer, Matthias [1 ]
Emmert-Streib, Frank [2 ,3 ]
机构：
[1] TU Vienna, Vienna Univ Technol, Inst Discrete Math & Geometry, A-1040 Vienna, Austria
[2] Univ Washington, Dept Biostat, Seattle, WA 98195 USA
[3] Univ Washington, Dept Genome Sci, Seattle, WA 98195 USA
来源：
COMPUTATIONAL BIOLOGY AND CHEMISTRY | 2008年 / 32卷 / 02期
关键词：
structural information content; graph entropy; information theory; gene networks; chemical graph theory;
D O I：
10.1016/j.compbiolchem.2007.09.007
中图分类号：
Q [生物科学];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
In this paper we define the structural information content of graphs as their corresponding graph entropy. This definition is based on local vertex functionals obtained by calculating-spheres via the algorithm of Dijkstra. We prove that the graph entropy and, hence, the local vertex functionals can be computed with polynomial time complexity enabling the application of our measure for large graphs. In this paper we present numerical results for the graph entropy of chemical graphs and discuss resulting properties. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码：131 / 138
页数：8
相关论文
共 50 条
  • [41] Community detection in social networks using structural and content information
    Akachar, Elyazid
    Ouhbi, Brahim
    Frikh, Bouchra
    IIWAS2018: THE 20TH INTERNATIONAL CONFERENCE ON INFORMATION INTEGRATION AND WEB-BASED APPLICATIONS & SERVICES, 2014, : 282 - 288
  • [42] Bridging the Gap between von Neumann Graph Entropy and Structural Information: Theory and Applications
    Liu, Xuecheng
    Fu, Luoyi
    Wang, Xinbing
    PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021), 2021, : 3699 - 3710
  • [43] On the Similarity Between von Neumann Graph Entropy and Structural Information: Interpretation, Computation, and Applications
    Liu, Xuecheng
    Fu, Luoyi
    Wang, Xinbing
    Zhou, Chenghu
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (04) : 2182 - 2202
  • [44] A Graph Distance Based Structural Clustering Approach for Networks
    Su, Xin
    Li, Chunping
    AI 2009: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5866 : 330 - 339
  • [45] Inequalities for entropy-based measures of network information content
    Dehmer, Matthias
    Mowshowitz, Abbe
    APPLIED MATHEMATICS AND COMPUTATION, 2010, 215 (12) : 4263 - 4271
  • [46] Structural reinforcement-based graph convolutional networks
    Qin, Jisheng
    Wang, Qianqian
    Tao, Tao
    CONNECTION SCIENCE, 2022, 34 (01) : 2807 - 2821
  • [47] KENN: Graph Kernel Neural Network Based on Linear Structural Entropy
    Xu L.-X.
    Xu W.
    Chen E.-H.
    Luo B.
    Tang Y.-Y.
    Ruan Jian Xue Bao/Journal of Software, 2024, 35 (05): : 2430 - 2445
  • [48] A Conceptual Graph-Based Method to Compute Information Content
    Quintero, Rolando
    Torres-Ruiz, Miguel
    Saldana-Perez, Magdalena
    Guzman Sanchez-Mejorada, Carlos
    Mata-Rivera, Felix
    MATHEMATICS, 2023, 11 (18)
  • [49] Recognition of opinion leaders in blockchain-based social networks by structural information and content contribution
    Wang, Chuansheng
    Tan, Xuecheng
    Shi, Fulei
    PEERJ COMPUTER SCIENCE, 2023, 9
  • [50] Attention-Based Aggregation Graph Networks for Knowledge Graph Information Transfer
    Zhao, Ming
    Jia, Weijia
    Huang, Yusheng
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2020, PT II, 2020, 12085 : 542 - 554
12345