Please use this identifier to cite or link to this item: https://scholar.ptuk.edu.ps/handle/123456789/290
cc-by
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDaraghmi, Eman-
dc.contributor.authorYuan, Shyan-Ming-
dc.date.accessioned2019-04-20T14:34:38Z-
dc.date.available2019-04-20T14:34:38Z-
dc.date.issued2012-
dc.identifier.citationEman Yasser Daraghmi and Yuan Shyan Ming. 2012. Using graph theory to re-verify the small world theory in an online social network word. In Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services (IIWAS '12). ACM, New York, NY, USA, 407-410. DOI=http://dx.doi.org/10.1145/2428736.2428811en_US
dc.identifier.urihttps://scholar.ptuk.edu.ps/handle/123456789/290-
dc.description.abstractThe development in social network services changes our traditional social structure. Nowadays, people can easily communicate with their old friends or even make new ones. The "Small World Theory" [5] states that the median path length equal to 6 when posting letters through intermediaries, but researchers have not prove this theory completely until now. Because of social networks our world becomes smaller and smaller. In this paper, we propose new ideas about the "Small World Theory". We performed our experiment on Facebook platform to collect social data. Additionally, the graph database is used to conduct further analyses. To re-verify the "Small World Theory" and to extend this theory, we focused on the degree of separation and control the size of the dataset. The experimental results show that our dataset is "Four Degrees of Separation", and this conclusion can be extended to the whole world by further experiments.en_US
dc.language.isoen_USen_US
dc.publisherACMen_US
dc.titleUsing graph theory to re-verify the small world theory in an online social network worden_US
dc.typeArticleen_US
Appears in Collections:Applied science faculty

Files in This Item:
File Description SizeFormat 
using graph.png772.18 kBimage/pngThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.