Exploring the evolution of node neighborhoods in Dynamic Networks

Creative Commons License

Orman G. K. , Labatut V., NASKALİ A. T.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, vol.482, pp.375-391, 2017 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 482
  • Publication Date: 2017
  • Doi Number: 10.1016/j.physa.2017.04.084
  • Page Numbers: pp.375-391
  • Keywords: Dynamic networks, Network evolution, Network topology, Neighborhood events, MOTIFS


Dynamic Networks are a popular way of modeling and studying the behavior of evolving systems. However, their analysis constitutes a relatively recent subfield of Network Science, and the number of available tools is consequently much smaller than for static networks. In this work, we propose a method specifically designed to take advantage of the longitudinal nature of dynamic networks. It characterizes each individual node by studying the evolution of its direct neighborhood, based on the assumption that the way this neighborhood changes reflects the role and position of the node in the whole network. For this purpose, we define the concept of neighborhood event, which corresponds to the various transformations such groups of nodes can undergo, and describe an algorithm for detecting such events. We demonstrate the interest of our method on three real world networks: DBLP, LastFM and Enron. We apply frequent pattern mining to extract meaningful information from temporal sequences of neighborhood events. This results in the identification of behavioral trends emerging in the whole network, as well as the individual characterization of specific nodes. We also perform a cluster analysis, which reveals that, in all three networks, one can distinguish two types of nodes exhibiting different behaviors: a very small group of active nodes, whose neighborhood undergo diverse and frequent events, and a very large group of stable nodes. (C) 2017 Elsevier B.V. All rights reserved.