Communicability in complex networks
Communicability
in complex networks
Professor Ernesto Estrada
Institute of Applied Mathematics
University of Zaragoza
Communication between nodes is an important and quite recent focus of research in the study of local and global properties of complex networks. Most of the measures representing this aspect are based on shortest paths connecting two nodes; nonetheless, information can spread in the network along non-shortest paths. Communicability has to be understood as a measure of how an information flow can be easily - or not - transmitted from a given node toward another one within a connected network. The talk will focus on some applications of this idea to different real networks and it will prove that communicability function may induce a new metric and an embedding of the network into a Euclidean space, introducing the concepts of communicability distances and angles. These results will be compared with the analogues outcomes obtained by using the shortest path metric for several examples.
March 19, 2019, 11:00
Aula Seminari 4026 - Edificio U7 (4° piano)
Via Bicocca degli Arcimboldi 8 – 20126 Milano
Per ulteriori informazioni: rosanna.grassi@unimib.it