Centralities in High Order Networks

• Klaus Wehmuth LNCC
• Artur Ziviani LNCC

DOI: https://doi.org/10.5753/etc.2018.3147

Resumo

We propose a method for computing centralities based on shortest paths in time-varying, multilayer, and time-varying multilayer networks using MultiAspect Graphs (MAG). Thanks to the MAG abstraction, these high order networks are represented in a way that is isomorphic to a directed graph. We then show that well-known centrality algorithms can be adapted to the MAG environment in a straightforward manner. Moreover, we show that, by using this representation, pitfalls usually associated with spurious paths resulting from aggregation in time-varying and multilayer networks can be avoided.

Referências

De Domenico, M., Granell, C., Porter, M. A., and Arenas, A. (2016). The physics of multilayer networks. arXiv, pages 1–22.

Freeman, L. C. (1977). A Set of Measures of Centrality Based on Betweenness. Sociometry, 40(1):35 – 41.

Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., and Porter, M. a. (2014). Multilayer networks. Journal of Complex Networks, 2(3):203–271.

Nicosia, V., Tang, J., Musolesi, M., Russo, G., Mascolo, C., and Latora, V. (2012). Components in time-varying graphs. Chaos, 22(2):023101.

Pan, R. and Saramäki, J. (2011). Path lengths, correlations, and centrality in temporal networks. Physical Review E, 84(1):1–10.

Ribeiro, B., Perra, N., and Baronchelli, A. (2013). Quantifying the effect of temporal resolution on time-varying networks. Scientific reports, 3:3006.

Wehmuth, K., Fleury, É., and Ziviani, A. (2016). On MultiAspect graphs. Theoretical Computer Science, 651:50–61.

Wehmuth, K., Fleury, E., and Ziviani, A. (2017). Multiaspect graphs: Algebraic representation and algorithms. Algorithms, 10(1).