[PDF][PDF] Cycle-Based versus Degree-based Classification of Social Networks.

K Mahdi, M Safar, I Sorkhoh, A Kassem - J. Digit. Inf. Manag., 2009 - researchgate.net
Complex networks can be classified in three main types: random networks, small-world
networks and scale-free networks. Two approaches are tested and compared to identify and …

Analysis of temporal evolution of social networks

K Mahdi, M Safar, H Farahat - Journal of Mobile …, 2009 - journals.riverpublishers.com
The article presents an analysis of dynamic social network where words, nodes and edges
appear and disappear through time. We study a popular virtual social network in the internet …

Detecting cycles in graphs using parallel capabilities of GPU

F Mahdi, M Safar, K Mahdi - … , DICTAP 2011, Dijon, France, June 21-23 …, 2011 - Springer
We present an approximation algorithm for detecting the number of cycles in an undirected
graph, using CUDA (Compute Unified Device Architecture) technology from NVIDIA and …

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

M Safar, H Farahat, K Mahdi - … of the 11th International Conference on …, 2009 - dl.acm.org
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 …

Universal cycles distribution function of social networks

M Safar, K Mahdi, A Kassem - 2009 First International …, 2009 - ieeexplore.ieee.org
Complex networks can be classified in three main types: random networks, small-world
networks and scale-free networks. In this work we studied the cycles distribution of these …

Robustness of dynamic social networks

M Safar, H Farahat, K Mahdi - Journal of Mobile …, 2010 - journals.riverpublishers.com
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 …