Centralities in High Order Networks

  • Klaus Wehmuth
  • Artur Ziviani


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.

WEHMUTH, Klaus; ZIVIANI, Artur. Centralities in High Order Networks. In: ENCONTRO DE TEORIA DA COMPUTAÇÃO (ETC), 3. , 2018, Natal. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2018 . ISSN 2595-6116. DOI: https://doi.org/10.5753/etc.2018.3147.