Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics

Most instruments - formalisms, concepts, and metrics - for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ranging from the fine-grain dynamics of interactions (which recently led researchers to consider temporal versions of distance, connectivity, and related indicators), to the evolution of network properties over longer periods of time. This paper proposes a general approach to study that evolution for both atemporal and temporal indicators, based respectively on sequences of static graphs and sequences of time-varying graphs that cover successive time-windows. All the concepts and indicators, some of which are new, are expressed using a time-varying graph formalism.

[1]  Jon M. Kleinberg,et al.  Protocols and impossibility results for gossip-based communication mechanisms , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

[3]  Tom A. B. Snijders,et al.  Introduction to stochastic actor-based models for network dynamics , 2010, Soc. Networks.

[4]  Bernard Mans,et al.  Measuring Temporal Lags in Delay-Tolerant Networks , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[5]  T. Snijders.  The statistical evaluation of social network dynamics , 2001 .

[6]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[7]  W. Powell,et al.  Network Dynamics and Field Evolution: The Growth of Interorganizational Collaboration in the Life Sciences1 , 2005, American Journal of Sociology.

[8]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[9]  M. Newman,et al.  Epidemics and percolation in small-world networks. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

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

[11]  P. Holland,et al.  TRANSITIVITY IN STRUCTURAL MODELS OF SMALL GROUPS , 1977 .

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

[13]  S. Fortunato,et al.  Statistical physics of social dynamics , 2007, 0710.3256.

[14]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[15]  Richard M. Murray,et al.  Networks with the Smallest Average Distance and the Largest Average Clustering , 2010, 1007.4031.

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

[17]  Marc Lelarge,et al.  Diffusion of Innovations on Random Networks: Understanding the Chasm , 2008, WINE.

[18]  Afonso Ferreira,et al.  Building a reference combinatorial model for MANETs , 2004, IEEE Network.

[19]  P. Lazarsfeld,et al.  Personal Influence: The Part Played by People in the Flow of Mass Communications , 1956 .

[20]  Alessandro Vespignani,et al.  Complex networks: Patterns of complexity , 2010 .

[21]  Bernard Mans,et al.  Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility , 2010, IFIP TCS.

[22]  Laurent Massoulié,et al.  The diameter of opportunistic mobile networks , 2007, CoNEXT '07.

[23]  Tanya Y. Berger-Wolf,et al.  Finding Spread Blockers in Dynamic Networks , 2008, SNAKDD.

[24]  P. Lazarsfeld,et al.  6. Katz, E. Personal Influence: The Part Played by People in the Flow of Mass Communications , 1956 .

[25]  Walter Quattrociocchi,et al.  Simulating opinion dynamics in heterogeneous communication systems , 2010 .

[26]  Afonso Ferreira,et al.  Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks , 2003, ADHOC-NOW.

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

[28]  Roger Guimerà,et al.  Team Assembly Mechanisms Determine Collaboration Network Structure and Team Performance , 2005, Science.

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

[30]  Christos Faloutsos,et al.  Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..

[31]  Mario Paolucci,et al.  On the effects of informational cheating on social evaluations: image and reputation through gossip , 2009, Int. J. Knowl. Learn..

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

[33]  Silvio Lattanzi,et al.  Almost tight bounds for rumour spreading with conductance , 2010, STOC '10.

[34]  Kathleen M. Carley,et al.  Structural Change and Homeostasis in Organizations: A Decision-Theoretic Approach , 2003 .

[35]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[36]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[37]  Nicola Santoro,et al.  Time-varying graphs and dynamic networks , 2010, Int. J. Parallel Emergent Distributed Syst..

[38]  Guillaume Deffuant,et al.  Mixing beliefs among interacting agents , 2000, Adv. Complex Syst..

[39]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[40]  Phillip Bonacich,et al.  Eigenvector-like measures of centrality for asymmetric relations , 2001, Soc. Networks.

[41]  Heiko Rieger,et al.  Stability of shortest paths in complex networks with random edge weights. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[42]  Tanya Y. Berger-Wolf,et al.  Betweenness Centrality Measure in Dynamic Networks , 2007 .

[43]  Walter Quattrociocchi,et al.  Selection in scientific networks , 2010, Social Network Analysis and Mining.