Analysis of dynamic social network: e-mail messages exchange network

Authors:
Maytham Safar;Hisham Farahat;Khaled Mahdi
Affiliations:
Kuwait University, Kuwait;Kuwait University, Kuwait;Kuwait University, Kuwait
Venue:
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Year:
2009

Citing 11
Cited 1

Statistical mechanics of complex networks

Statistical mechanics of complex networks
Email as spectroscopy: automated discovery of community structure within organizations

Communities and technologies
Exploratory Social Network Analysis with Pajek

Exploratory Social Network Analysis with Pajek
Leveraging Social Networks to Fight Spam

Computer
Criminal network analysis and visualization

Communications of the ACM - 3d hard copy
Email alias detection using social network analysis

Proceedings of the 3rd international workshop on Link discovery
Automated social hierarchy detection through email network analysis

Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Temporal evolution of social networks in Paltalk™

Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
Segmentation and Automated Social Hierarchy Detection through Email Network Analysis

Advances in Web Mining and Web Usage Analysis
On some current results of graph theory for ad-hoc networks

Journal of Mobile Multimedia
Analysis of temporal evolution of social networks

Journal of Mobile Multimedia

Robustness of dynamic social networks

Journal of Mobile Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

Counting entropy of social networks is used to study the dynamic of such networks. It depends on counting the number of cycles in the network, which is an NP problem. In this work we used a polynomial time approximation algorithm to count the number of cycles in an undirected graph that is based on regression and on a statistical mechanics approach. We used this approximation algorithm to analysis the dynamicity of a virtual social network, E-mail Messages Exchange Network (EMEN) where nodes and edges appear and disappear through time. We analyze the exact and approximated cyclic entropy variation with time as a function of the number of nodes and edges in the network. The purpose is to establish the robustness of the network. In addition, we study the effect of weighed links (number of interactions between users) on the analysis of such graphs.