Robustness of dynamic social networks

Authors:
Maytham Safar;Hisham Farahat;Khaled Mahdi
Affiliations:
Computer Engineering Department, Kuwait University, Kuwait, Kuwait City, Kuwait;Computer Engineering Department, Kuwait University, Kuwait, Kuwait City, Kuwait;Chemical Engineering Department, Kuwait University, Kuwait, Kuwait City, Kuwait
Venue:
Journal of Mobile Multimedia
Year:
2010

Citing 14
Cited 0

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
Harnessing user contributions and dynamic profiling to better satisfy individual information search needs

International Journal of Web and Grid Services
Temporal evolution of social networks in Paltalk™

Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
A clustering analysis and agent-based trust model in a grid environment supporting virtual organisations

International Journal of Web and Grid Services
Segmentation and Automated Social Hierarchy Detection through Email Network Analysis

Advances in Web Mining and Web Usage Analysis
Ubiquitous supervisory system based on social contexts using ontology

Mobile Information Systems - Advances in Mobile Communications and Computing
Analysis of dynamic social network: e-mail messages exchange network

Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The cyclic entropy of a real virtual friendship network provides an insight on the degree of its robustness. Cyclic entropy depends on counting the number of cycles of different sizes in the network, in which a probability distribution function is resulted. Counting the number of cycles in the network 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, Email 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. We further compare the cyclic entropy variation of the network to the traditional degree entropy variation. 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. An actual friendship network is found to have cyclic entropy bounded between random and small-world networks models.