In the latest three lectures, we
are in touched with Social Network Analysis (SNA), which is a key component of
the Social Network Research Field. And we get a superficial understanding of
the different algorithm defined in SNA by doing some exercise on and after
classes. And a question came to my mind afterwards. Did the social graph
correctly represent the relations between human beings in SNS?
Let’s have an exercise to find the
problem.
We assume that 5 people (From n1 to
n5) are in the same SNS and their relationship can be represented by the graph
below (Graph1).
Graph1: Normal Graph
Then we will use some algorithms in
SNA to analysis it.
Degree Centrality:
Cd
= 0.667
|
Closeness Centrality:
Cc
= 0.26
|
||||||||||||||||||||||||||||||||||||
Betweenness Centrality:
Cb
= 0.5625
|
From the results of SNA, we can get
some information:
1. The SNS shown by Graph1 is with high Degree Centrality and
Betweenness Centrality.
2.
Node n1 is the most important node in this SNS (with highest Cd, Cc
and Cd).
However usually the relationships
in the real SNS are not such simple, there are thousands types of
relationships, for example, Tim and Bill are best friends while Tom and Sissy
were just got to know, and obviously the strength of two previous relationships
are not the same so I think it is unfair to assign all relations in SNS with
the same value 1.
Let’s use the case
showed by Graph1 again and adding some additional information: (1) n3 and n4 are best friends. (3) n3 and n5
are old friends. (4) n1 is a friend of n2 (5) n1 was just got to know n3, n4
and n5.
And this time we divide
the relations into 4 levels and use a weighted graph to represent their
relations again, as shown in Graph2.
Graph2: Weighted Graph
Now do the SNA again with the same
algorithms.
Degree Centrality:
Cd
= 0.333
|
Closeness Centrality:
Cc
= 0.256
|
||||||||||||||||||||||||||||||||||||
Betweenness Centrality:
Cb
= Unfinished
|
Due to time limited, I cannot
finish the calculation of Betweenness Centrality (Awful complex, I’m afraid (-
-#)) and there may be some mistakes in calculation, but the result changes a
lot:
1. Degree Centrality of the SNS getting lower, it is about 1/2 of the
previous SNA.
2. Node n3 becomes the most important node (with highest Cd and Cc),
while in the previous SNA it is n1.
In conclusion, the result
completely changed when we take the weight of the relationships into
consideration, and I believe using weighted graphs is a more reasonable and humane way to do SNA
(If you do not consider the weight of relations to analysis the second case,
the result will be unconvincing).
References:
- Angela Bohn & Norbert Walchhofer & Patrick Mair &Kurt Hornik: Social Network Analysis of Weighted Telecommunications Graphs
- M. E. J. Newman: Analysis of weighted networks
- http://toreopsahl.com/tnet/weighted-networks/node-centrality/





