Information Diffusion in Complex Networks

When: Thursday, November 14, 2013 at 2:00 pm
Where: DA 5th fl
Speaker: Ernesto Estrada
Organization: Department of Mathematics and Statistics, University of Strathclyde, Journal of Complex Networks, Institute for Quantitative Theory and Methods (QuanTM), Emory University
Sponsor: MoBS and CCNR

I will make a gentle introduction to the topic of complex networks. Starting from the
Milgram experiment and the concept of ‘Small-World’ I will motivate the necessity for
defining some metrics that characterize the ways in which ‘information’ is diffused in
such complex networked systems. Then, I will introduce the concept of network
communicability and we illustrate the use of matrix functions for its quantitative
characterization. I will then introduce a new metric, called the communicability
distance. It characterizes the distance between two nodes in terms of the routes used
by information to diffuse from one place to another in the network. Finally, I will
extend these concepts to study networks evolving in time as well as networks where
the information flows in parallel layers (multiplexes).