DocumentCode
1787064
Title
Quantification and comparison of degree distributions in complex networks
Author
Aliakbary, Sadegh ; Habibi, Jafar ; Movaghar, Ali
Author_Institution
Sharif University of Technology, Tehran, Iran
fYear
2014
fDate
9-11 Sept. 2014
Firstpage
464
Lastpage
469
Abstract
The degree distribution is an important characteristic in complex networks. In many applications, quantification of degree distribution in the form of a fixed-length feature vector is a necessary step. Additionally, we often need to compare the degree distribution of two given networks and extract the amount of similarity between the two distributions. In this paper, we propose a novel method for quantification of the degree distributions in complex networks. Based on this quantification method, a new distance function is also proposed for degree distributions, which captures the differences in the overall structure of the two given distributions. The proposed method is able to effectively compare networks even with different scales, and outperforms the state of the art methods considerably, with respect to the accuracy of the distance function. The datasets and more detailed evaluations are available upon request.
Keywords
Accuracy; Complex networks; Equations; Feature extraction; Mathematical model; Measurement; Vectors; Complex Network; Degree Distribution; Distance Function; Feature Extraction; Kolmogorov-Smirnov Test; Power-law; Social Network;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications (IST), 2014 7th International Symposium on
Conference_Location
Tehran
Print_ISBN
978-1-4799-5358-5
Type
conf
DOI
10.1109/ISTEL.2014.7000748
Filename
7000748
Link To Document