The Dynamic Structural Patterns of Social Networks Based on Triad Transitions

In modern social networks built from the data collected in various computer systems we observe constant changes corresponding to external events or the evolution of underlying organizations. In this work we present a new approach to the description and quantifying evolutionary patterns of social networks illustrated with the data from the Enron email dataset. We propose the discovery of local network connection patterns (in this case: triads of nodes), measuring their transitions during network evolution and present the preliminary results of this approach. We define the Triad Transition Matrix (TTM) containing the probabilities of transitions between triads, then we show how it can help to discover the dynamic patterns of network evolution. Also, we analyse the roles performed by different triads in the network evolution by the creation of triad transition graph built from the TTM, which allows us to characterize the tendencies of structural changes in the investigated network. The future applications of our approach are also proposed and discussed.

[1]  Katarzyna Musial,et al.  Temporal Changes in Local Topology of an Email-Based Social Network , 2009, Comput. Informatics.

[2]  Tanya Y. Berger-Wolf,et al.  Mining Periodic Behavior in Dynamic Social Networks , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[3]  S. Mangan,et al.  Structure and function of the feed-forward loop network motif , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Amit Kumar,et al.  Connectivity and inference problems for temporal networks , 2000, Symposium on the Theory of Computing.

[5]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[6]  Jon Kleinberg,et al.  The link prediction problem for social networks , 2003, CIKM '03.

[7]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[8]  Lisa Singh,et al.  Increasing the Predictive Power of Affiliation Networks , 2007, IEEE Data Eng. Bull..

[9]  S. Mangan,et al.  The coherent feedforward loop serves as a sign-sensitive delay element in transcription networks. , 2003, Journal of molecular biology.

[10]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[11]  Vladimir Batagelj,et al.  A subquadratic triad census algorithm for large sparse networks with small maximum degree , 2001, Soc. Networks.

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

[13]  Uri Alon,et al.  Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs , 2004, Bioinform..

[14]  Thilo Gross,et al.  Adaptive Networks: Theory, Models and Applications , 2009 .

[15]  A Vázquez,et al.  The topological relationship between the large-scale attributes and local interaction patterns of complex networks , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Dan Braha,et al.  From Centrality to Temporary Fame: Dynamic Centrality in Complex Networks , 2006, Complex..

[17]  Katarzyna Musial,et al.  Local Topology of Social Network Based on Motif Analysis , 2008, KES.

[18]  Hawoong Jeong,et al.  Exploring local structural organization of metabolic networks using subgraph patterns. , 2006, Journal of theoretical biology.

[19]  Albert-László Barabási,et al.  The origin of bursts and heavy tails in human dynamics , 2005, Nature.

[20]  R. Milo,et al.  Subgraphs in random networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.