|
Title:
|
CLASSIFICATION OF SOCIAL NETWORKS |
|
Author(s):
|
Ibrahim Sorkhoh , Maytham Safar , Khaled Mahdi |
|
ISBN:
|
978-972-8924-68-3 |
|
Editors:
|
Pedro Isaías, Miguel Baptista Nunes and Dirk Ifenthaler |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
Social Networks, Robustness, Maximum, Entropy, Cycles, Classification |
|
Type:
|
Full Paper |
|
First Page:
|
110 |
|
Last Page:
|
118 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Internet is used as social platform to host virtual friendship societies that emulate lively social network. In this work, we
compute different social network parameters used in the literature such as average degree, clustering coefficient, and
average path length to analyze a virtual friendship network. In addition, we calculated a lighter version of cyclic entropy
by studying the growth of the number of triads (smallest cycle size in a network) in terms of the size of the network. The
experimental results indicated that our virtual friendship network can be classified as a small-world network according to
the network average vertex degree, average path length, and clustering coefficients. Furthermore, the increase in the
number of triads as the network grows larger in an undirected social network is one magnitude of order higher than that
of a directed social network. |
|
|
|
|
|
|
