DocumentCode :
3155675
Title :
Cyclic Entropy of Complex Networks
Author :
Sorkhoh, I. ; Mahdi, Khalid ; Safar, Mona
Author_Institution :
Comput. Eng. Dept., Kuwait Univ., Safat, Kuwait
fYear :
2012
fDate :
26-29 Aug. 2012
Firstpage :
1050
Lastpage :
1055
Abstract :
We calculate the cyclic entropy of a real virtual friendship network to have an insight on the degree of its robustness. Upon counting the number of cycles of different sizes in the network, a probability distribution function is resulted. An actual friendship network is found to have cyclic entropy bounded between random and small-world networks models. It has dual properties. Small world networks indicate the existence of critical network sizes: 150 and 700 at which the cyclic entropy is minimum. Scale-free networks have the highest cyclic entropy among all other complex network models regardless of the size of the network.
Keywords :
network theory (graphs); small-world networks; statistical distributions; complex network; critical network size; cyclic entropy; probability distribution function; random-world networks model; scale-free network; small-world networks model; virtual friendship network; Approximation algorithms; Approximation methods; Complex networks; Entropy; Equations; Mathematical model; Robustness;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advances in Social Networks Analysis and Mining (ASONAM), 2012 IEEE/ACM International Conference on
Conference_Location :
Istanbul
Print_ISBN :
978-1-4673-2497-7
Type :
conf
DOI :
10.1109/ASONAM.2012.182
Filename :
6425620
Link To Document :
بازگشت