Articles producció científica> Enginyeria Informàtica i Matemàtiques

Centrality rankings in multiplex networks

  • Dades identificatives

    Identificador: imarina:5753899
    Autors:
    Solé-Ribalta ADe Domenico MGómez SArenas A
    Resum:
    The vertiginous increase of e-platforms for social communication has boosted the ways people use to interact each other. Micro-blogging and decentralized posts are used indistinctly for social interaction, usually by the same individuals acting simultaneously in the different platforms. Multiplex networks are the natural abstraction representation of such layered relationships and others, like co-authorship. Here, we re-define the betweenness centrality measure to account for the inherent structure of multiplex networks and propose an algorithm to compute it in an effcient way. To show the necessity and the advantage of the proposed definition, we analyze the obtained centralities for two real multiplex networks, a social multiplex of two layers obtained from Twitter and Instagram and a co-authorship network of four layers obtained from arXiv. Results show that the proposed definition provides more accurate results than the current approach of evaluating the classical betweenness centrality on the aggregated network, in particular for the middle ranked nodes. We also analyze the computational cost of the presented algorithm. Copyright © 2014 ACM.
  • Altres:

    Autor segons l'article: Solé-Ribalta A; De Domenico M; Gómez S; Arenas A
    Departament: Enginyeria Informàtica i Matemàtiques Enginyeria Informàtica i Matemàtiques
    Autor/s de la URV: Arenas Moreno, Alejandro / DE DOMENICO, MANLIO / Gómez Jiménez, Sergio / Solé Ribalta, Albert
    Paraules clau: Multiplex networks Multilayer networks Betweenness centrality
    Resum: The vertiginous increase of e-platforms for social communication has boosted the ways people use to interact each other. Micro-blogging and decentralized posts are used indistinctly for social interaction, usually by the same individuals acting simultaneously in the different platforms. Multiplex networks are the natural abstraction representation of such layered relationships and others, like co-authorship. Here, we re-define the betweenness centrality measure to account for the inherent structure of multiplex networks and propose an algorithm to compute it in an effcient way. To show the necessity and the advantage of the proposed definition, we analyze the obtained centralities for two real multiplex networks, a social multiplex of two layers obtained from Twitter and Instagram and a co-authorship network of four layers obtained from arXiv. Results show that the proposed definition provides more accurate results than the current approach of evaluating the classical betweenness centrality on the aggregated network, in particular for the middle ranked nodes. We also analyze the computational cost of the presented algorithm. Copyright © 2014 ACM.
    Àrees temàtiques: Computer networks and communications
    Adreça de correu electrònic de l'autor: albert.sole@urv.cat sergio.gomez@urv.cat alexandre.arenas@urv.cat
    Identificador de l'autor: 0000-0002-2953-5338 0000-0003-1820-0062 0000-0003-0937-0334
    Data d'alta del registre: 2024-09-28
    URL Document de llicència: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referència a l'article segons font original: Websci 2014 - Proceedings Of The 2014 Acm Web Science Conference. 149-155
    Referència de l'ítem segons les normes APA: Solé-Ribalta A; De Domenico M; Gómez S; Arenas A (2014). Centrality rankings in multiplex networks.
    DOI de l'article: 10.1145/2615569.2615687
    Entitat: Universitat Rovira i Virgili
    Any de publicació de la revista: 2014
    Tipus de publicació: Proceedings Paper
  • Paraules clau:

    Computer Networks and Communications
    Multiplex networks
    Multilayer networks
    Betweenness centrality
    Computer networks and communications
  • Documents:

  • Cerca a google

    Search to google scholar