Abstract
AbstractModeling complex systems that consist of different types of objects leads to multilayer networks, where nodes in the different layers represent different kinds of objects. Nodes are connected by edges, which have positive weights. A multilayer network is associated with a supra-adjacency matrix. This paper investigates the sensitivity of the communicability in a multilayer network to perturbations of the network by studying the sensitivity of the Perron root of the supra-adjacency matrix. Our analysis sheds light on which edge weights to make larger to increase the communicability of the network, and which edge weights can be made smaller or set to zero without affecting the communicability significantly.
Funder
Università degli Studi di Roma La Sapienza
Publisher
Springer Science and Business Media LLC
Reference24 articles.
1. Benzi, M., Klymko, C.: Total communicability as a centrality measure. J. Complex Networks 1, 124–149 (2013)
2. Bergermann, K.: Multiplex-matrix-function-centralities. https://github.com/KBergermann/Multiplex-matrix-function-centralities
3. Bergermann, K., Stoll, M.: Fast computation of matrix function-based centrality measures for layer-coupled multiplex networks. Phys. Rev. E 105, 034305 (2022)
4. Brezinski, C., Redivo-Zaglia, M.: The PageRank vector: properties, computation, approximation, and acceleration. SIAM J. Matrix Anal. Appl. 28, 551–575 (2006)
5. Brezinski, C., Redivo-Zaglia, M.: Rational extrapolation for the PageRank vector. Math. Comp. 77, 1585–1598 (2008)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献