An information-theoretic, all-scales approach to comparing networks

被引:0
|
作者
James P. Bagrow
Erik M. Bollt
机构
[1] Department of Mathematics & Statistics,Department of Mathematics
[2] Vermont Complex Systems Center,undefined
[3] University of Vermont,undefined
[4] Clarkson University,undefined
来源
关键词
Network comparison; Graph similarity; Multilayer networks; Temporal networks; Weighted networks; Network portraits; GitHub; Arabidopsis; C. Elegans connectome;
D O I
暂无
中图分类号
学科分类号
摘要
As network research becomes more sophisticated, it is more common than ever for researchers to find themselves not studying a single network but needing to analyze sets of networks. An important task when working with sets of networks is network comparison, developing a similarity or distance measure between networks so that meaningful comparisons can be drawn. The best means to accomplish this task remains an open area of research. Here we introduce a new measure to compare networks, the Network Portrait Divergence, that is mathematically principled, incorporates the topological characteristics of networks at all structural scales, and is general-purpose and applicable to all types of networks. An important feature of our measure that enables many of its useful properties is that it is based on a graph invariant, the network portrait. We test our measure on both synthetic graphs and real world networks taken from protein interaction data, neuroscience, and computational social science applications. The Network Portrait Divergence reveals important characteristics of multilayer and temporal networks extracted from data.
引用
收藏
相关论文
共 50 条
  • [1] An information-theoretic, all-scales approach to comparing networks
    Bagrow, James P.
    Bollt, Erik M.
    [J]. APPLIED NETWORK SCIENCE, 2019, 4 (01)
  • [2] An information-theoretic approach for detecting communities in networks
    Yongli Li
    Chong Wu
    Zizheng Wang
    [J]. Quality & Quantity, 2015, 49 : 1719 - 1733
  • [3] An information-theoretic approach for detecting communities in networks
    Li, Yongli
    Wu, Chong
    Wang, Zizheng
    [J]. QUALITY & QUANTITY, 2015, 49 (04) : 1719 - 1733
  • [4] An information-theoretic approach to study activity driven networks
    Bongiorno, Christian
    Rizzo, Alessandro
    Porfiri, Maurizio
    [J]. 2018 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2018,
  • [5] Distributed robotic sensor networks: An information-theoretic approach
    Julian, Brian J.
    Angermann, Michael
    Schwager, Mac
    Rus, Daniela
    [J]. INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2012, 31 (10): : 1134 - 1154
  • [6] On the Cost of Knowledge of Mobility in Dynamic Networks: An Information-Theoretic Approach
    Wang, Di
    Abouzeid, Alhussein A.
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2012, 11 (06) : 995 - 1006
  • [7] Optimal Control of Probabilistic Boolean Networks: An Information-Theoretic Approach
    Sonam, K.
    Sutavani, Sarang
    Wagh, S.R.
    Singh, N.M.
    [J]. IEEE Access, 2021, 9 : 157068 - 157082
  • [8] Subgraph Covers: An Information-Theoretic Approach to Motif Analysis in Networks
    Wegner, Anatol E.
    [J]. PHYSICAL REVIEW X, 2014, 4 (04):
  • [9] Optimal Control of Probabilistic Boolean Networks: An Information-Theoretic Approach
    Sonam, K.
    Sutavani, Sarang
    Wagh, S. R.
    Singh, N. M.
    [J]. IEEE ACCESS, 2021, 9 : 157068 - 157082
  • [10] An Information-theoretic Approach to Distribution Shifts
    Federici, Marco
    Tomioka, Ryota
    Forre, Patrick
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34