Communicability across evolving networks.

Many natural and technological applications generate time-ordered sequences of networks, defined over a fixed set of nodes; for example, time-stamped information about "who phoned who" or "who came into contact with who" arise naturally in studies of communication and the spread of disease. Concepts and algorithms for static networks do not immediately carry through to this dynamic setting. For example, suppose A and B interact in the morning, and then B and C interact in the afternoon. Information, or disease, may then pass from A to C, but not vice versa. This subtlety is lost if we simply summarize using the daily aggregate network given by the chain A-B-C. However, using a natural definition of a walk on an evolving network, we show that classic centrality measures from the static setting can be extended in a computationally convenient manner. In particular, communicability indices can be computed to summarize the ability of each node to broadcast and receive information. The computations involve basic operations in linear algebra, and the asymmetry caused by time's arrow is captured naturally through the noncommutativity of matrix-matrix multiplication. Illustrative examples are given for both synthetic and real-world communication data sets. We also discuss the use of the new centrality measures for real-time monitoring and prediction.

[1]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[2]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[3]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[4]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

[5]  K. Berman.  Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.

[6]  Kenneth A. Berman,et al.  Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.

[7]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[8]  R. Levitt,et al.  Computational Mathematical Organization Theory Workshop Agenda an Adaptive Simulation Approach for Investigating Information Processing Structures in Organizations Organizational Adaptation in a Volatile Environment Designing Quality into Product Development Organizations through Computational Organ , 2000 .

[9]  Amit Kumar,et al.  Connectivity and inference problems for temporal networks , 2000, STOC '00.

[10]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[11]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[12]  P. Holme.  Network reachability of real-world contact sequences. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Bülent Yener,et al.  Graph Theoretic and Spectral Analysis of Enron Email Data , 2005, Comput. Math. Organ. Theory.

[15]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[16]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[17]  Ernesto Estrada,et al.  Statistical-mechanical approach to subgraph centrality in complex networks , 2007, 0905.4098.

[18]  Yunhao Liu,et al.  Proceedings of the 17th international conference on World Wide Web , 2008, WWW 2008.

[19]  Liam McNamara,et al.  Media sharing based on colocation prediction in urban transport , 2008, MobiCom '08.

[20]  Jon M. Kleinberg,et al.  The structure of information pathways in a social communication network , 2008, KDD.

[21]  Ernesto Estrada,et al.  Communicability in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Jure Leskovec,et al.  Planetary-scale views on a large instant-messaging network , 2008, WWW.

[23]  D. Higham,et al.  A weighted communicability measure applied to complex brain networks , 2009, Journal of The Royal Society Interface.

[24]  Peter Grindrod,et al.  Evolving graphs: dynamical models, inverse problems and propagation , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[25]  David Lazer,et al.  Inferring friendship network structure by using mobile phone data , 2009, Proceedings of the National Academy of Sciences.

[26]  Tamara G. Kolda,et al.  Link Prediction on Evolving Data Using Matrix and Tensor Factorizations , 2009, 2009 IEEE International Conference on Data Mining Workshops.

[27]  M. Barthelemy,et al.  Microdynamics in stationary complex networks , 2008, Proceedings of the National Academy of Sciences.

[28]  Ernesto Estrada,et al.  Communicability betweenness in complex networks , 2009, 0905.4102.

[29]  Cecilia Mascolo,et al.  Temporal distance metrics for social network analysis , 2009, WOSN '09.

[30]  A. Maule,et al.  Normal growth of Arabidopsis requires cytosolic invertase but not sucrose synthase , 2009, Proceedings of the National Academy of Sciences.

[31]  V Latora,et al.  Small-world behavior in time-varying graphs. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  Cecilia Mascolo,et al.  Characterising temporal distance and reachability in mobile and online social networks , 2010, CCRV.

[33]  Jukka-Pekka Onnela,et al.  Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.

[34]  Rowland R. Kao,et al.  Networks and Models with Heterogeneous Population Structure in Epidemiology , 2010, Network Science.

[35]  Cecilia Mascolo,et al.  Analysing information flows and key mediators through temporal centrality metrics , 2010, SNS '10.

[36]  Desmond J. Higham,et al.  Network Properties Revealed through Matrix Functions , 2010, SIAM Rev..

[37]  Desmond J. Higham,et al.  Network Science - Complexity in Nature and Technology , 2010, Network Science.

[38]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[39]  Desmond J. Higham,et al.  Googling the Brain: Discovering Hierarchical and Asymmetric Network Structures, with Applications in Neuroscience , 2011, Internet Math..