TUNABLE EIGENVECTOR-BASED CENTRALITIES FOR MULTIPLEX AND TEMPORAL NETWORKS

被引:30
|
作者
Taylor, Dane [1 ]
Porter, Mason A. [2 ]
Mucha, Peter J. [3 ,4 ]
机构
[1] SUNY Buffalo, Dept Math, Univ Buffalo, Buffalo, NY 14214 USA
[2] Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA
[3] Univ N Carolina, Carolina Ctr Interdisciplinary Appl Math, Dept Math, Chapel Hill, NC 27599 USA
[4] Univ N Carolina, Dept Appl Phys Sci, Chapel Hill, NC 27599 USA
来源
MULTISCALE MODELING & SIMULATION | 2021年 / 19卷 / 01期
基金
美国国家卫生研究院; 美国国家科学基金会;
关键词
network science; multilayer networks; data integration; ranking systems; perturbation theory; COMMUNITY STRUCTURE; RANKING; MATRIX; OPTIMIZATION; PAGERANK; MODELS; NODES;
D O I
10.1137/19M1262632
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Characterizing the importances (i.e., centralities) of nodes in social, biological, and technological networks is a core topic in both network analysis and data science. We present a linear-algebraic framework that generalizes eigenvector-based centralities, including PageRank and hub/authority scores, to provide a common framework for two popular classes of multilayer networks: multiplex networks (which have layers that encode different types of relationships) and temporal networks (in which relationships change over time). Our approach involves the study of joint, marginal, and conditional "supracentralities" that one can calculate from the dominant eigenvector of a supracentrality matrix [Taylor et al., Multiscale Model. Simul., 15 (2017), pp. 537-574; [110] in this paper], which couples centrality matrices that are associated with individual network layers. We extend this prior work (which was restricted to temporal networks with layers that are coupled by adjacent-in-time coupling) by allowing the layers to be coupled through a (possibly asymmetric) interlayer-adjacency matrix (A) over tilde where the entry (A) over tilde (tt') >= 0 encodes the coupling between layers t and t'. Our framework provides a unifying foundation for centrality analysis of multiplex and temporal networks, and it also illustrates a complicated dependency of the supracentralities on the topology and weights of interlayer coupling. By scaling (A) over tilde by an interlayer-coupling strength omega >= 0 and developing a singular perturbation theory for the limits of weak (omega -> 0(+)) and strong (omega -> infinity) coupling, we also reveal an interesting dependence of supracentralities on the right and left dominant eigenvectors of (A) over tilde. We provide additional theoretical and practical insights by applying our framework to two empirical data sets: a multiplex network of airline transportation in Europe and a temporal network that encodes the graduation and hiring of mathematical scientists at United States universities.
引用
收藏
页码:113 / 147
页数:35
相关论文
共 50 条
  • [1] TUNABLE EIGENVECTOR-BASED CENTRALITIES FOR MULTIPLEX AND TEMPORAL NETWORKS (vol 19, pg 113, 2021)
    Taylor, Dane
    Porter, Mason A.
    Mucha, Peter J.
    MULTISCALE MODELING & SIMULATION, 2022, 20 (03): : 1167 - 1167
  • [2] Eigenvector-based centralities for multilayer temporal networks under the framework of tensor computation
    Lv, Laishui
    Zhang, Kun
    Zhang, Ting
    Li, Xun
    Sun, Qi
    Zhang, Lilinqing
    Xue, Wei
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 184
  • [3] Tie-Decay Networks in Continuous Time and Eigenvector-Based Centralities
    Ahmad, Walid
    Porter, Mason A.
    Beguerisse-Diaz, Mariano
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2021, 8 (02): : 1759 - 1771
  • [4] EIGENVECTOR-BASED CENTRALITY MEASURES FOR TEMPORAL NETWORKS
    Taylor, Dane
    Myers, Sean A.
    Clauset, Aaron
    Porter, Mason A.
    Mucha, Peter J.
    MULTISCALE MODELING & SIMULATION, 2017, 15 (01): : 537 - 574
  • [5] NODE AND LAYER. EIGENVECTOR CENTRALITIES FOR MULTIPLEX NETWORKS
    Tudisco, Francesco
    Arrigo, Francesca
    Gautier, Antoine
    SIAM JOURNAL ON APPLIED MATHEMATICS, 2018, 78 (02) : 853 - 876
  • [6] Eigenvector-based approach to neutrino mixing
    Sierra, D. Aristizabal
    Varzielas, I. de Medeiros
    Houet, E.
    PHYSICAL REVIEW D, 2013, 87 (09):
  • [7] On graph combinatorics to improve eigenvector-based measures of centrality in directed networks
    Arratia, Argimiro
    Marijuan, Carlos
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 504 : 325 - 353
  • [8] Eigenvector-based identification of bipartite subgraphs
    Paul, Debdas
    Stevanovic, Dragan
    DISCRETE APPLIED MATHEMATICS, 2019, 269 : 146 - 158
  • [9] On eigenvector-like centralities for temporal networks: Discrete vs. continuous time scales
    Flores, Julio
    Romance, Miguel
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2018, 330 : 1041 - 1051
  • [10] Application of LASSO to the Eigenvector Selection Problem in Eigenvector-based Spatial Filtering
    Seya, Hajime
    Murakami, Daisuke
    Tsutsumi, Morito
    Yamagata, Yoshiki
    GEOGRAPHICAL ANALYSIS, 2015, 47 (03) : 284 - 299