PageRank is based on the 'random suffer' idea and the web is seen as a markov chain
Correct Answer:
Verified
Q1: Eigenvector centrality is an
A)An Important nodes has
Q2: Katz centrality can be
A)Used to compute centrality
Q3: Page rank is the method
A)For rating the
Q4: The most popular social networking website twitter
Q6: vertices that have a high probability of
Q7: The number of actors outside the group
Q8: Transitivity is the tendency for friend of
Q9: In any directed graph if all edges
Q10: Reciprocity can be computed using
A)Simple Matrix
B)Adjacency Matrix
C)Eigen
Q11: Social Status theory measures how inconsistent individuals
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents