In last three lectures, the SNA which is the most useful and
accurate tool to explain the pattern of interaction between actors has been
introduced in detail by Prof. Rosanna. Through the SNA, abstract social
relationship could be transformed into math model to measure and calculate which
might be more convenient to study and make decisions for researchers in further.
More specifically, there are numerous methods in SNA, from graph theory to
socio matrix, from centrality to prestige, and all the way to ranking. However,
in my opinion, there are some trifles need to be decomposed, although the
lecture notes has involved almost of all aspects in SNA.
1. Powers
of a Matrix
From
the lecture, I am confirmed that every classmate could write the zero-one
matrix to express any social relationship. However, in terms of powers of a
matrix, maybe we have something confused. Now, let us review the knowledge of linear algebra learnt before. To
matrix X, if Xij=p (Xij is the element in the ith
, row jth column), that implies the number of methods from ni to
nj walking length n is p. Therefore, in social networking, the
entries of the matrix Xp give the total number of walks of length p
from node ni to nj and the value of Xij in Xp
gives the quantity of probability. Here, we might surprisingly find why
there is relationship between A and B in matrix X, the value being 0 in X2
, but in X3 they have relationship as well. Maybe we can draw
a picture like this.
From
the picture, length 1, A to B, length 2, we cannot find any ways, and length 3,
there is a way A to C to D to B. Obviously, these properties would be same for
both directed and nondirected graph.
2. Group
Degree Centralization
In
terms of the calculation formula
Where,
g is the number of actors.
CD(n*)
means the largest degree of actor, CD(ni) implies the
number of degree of actor ni. So we could calculate the numerator
easily. For the denominator, there might be something confused with the meaning
of “max”. In fact, it could be understood as the max value of numerator
in entire probable topology patterns including star, circle and line etc.. To estimate
the denominator, we should let CD(n*) become largest and CD(ni)
become smallest. Undoubtedly, maximum value of the denominator occurs when the
network is in star shape, which equals to numerator in star shape. Therefore,
we could deduce it is (g-1)(g-2) and CD =1 in star shape definitively.
3. PageRank
Before
discussion of the PageRank, there is need to have a review of Rank prestige. To
the topology
The
sociomatrix X is
p
= X’p, Which corresponds to the system of equations
On
the other hand, the calculation of PageRank is still ambiguous after
reading the content of Slide 25 in Week 9. What does the formula mean? And how to use it?
We
could analysis every element step by step first. To Actor A, the direction to
it is just C, but the Actor C directing to other actors is just A as well. So
To Actor B, the direction to B is just A, and A directing to B and C which make up of 1/2. Hence,
To
Actor C, the direction to C is A and B, A directing to B and C which make up of
1/2, and B only direct to C. Therefore,
Having
a detailed understanding and recognition of these mathematical
questions, there are no obstacles to analysis the social model and psychology.
Actually, there are some other interesting parts of SNA not included in the
article, and you might dig them personally.