An Overview of Eigenvector Centrality and Pagerank for Social Networks.

[@johng5295]

Thanks in a million. Great content. Awesome. Very well explained. I couldn't find this explanation--simply put anywhere else. Great teachers are hard to find. Grade: A++💥

[@SergioSerrano83]

I would like to thank you for the series on SNA statistics with gephi. It has been very helpful to understand clearly how to interpret centrality values in my research.

[@shallubatra6913]

Thank you so much sir ..please tell how we create nodes or edge files ??

[@user-bb4vp9ke9b]

Thank you so much for these videos they have been so useful for getting to grips with graph theory. I am wondering is it inappropriate to use eigenvector centrality in a directed graph, I am looking at a hyperlink network in a wiki

[@AlanShawesq]

Use Pagerank for directed graphs: if you can calculate both numbers and you will see the difference.

[@user-bb4vp9ke9b]

@@AlanShawesq Thank you! Can I ask why gephi offers the option of choosing a directed option when you calculate EVC (and undirected when you do pagerank) and what difference this makes

[@AlanShawesq]

@@user-bb4vp9ke9b Hi Catherine, many of these software platforms (including. SPSS and Node XL) have the algorithms to undertake certain calculations but they are unable to distinguish if it is being applied in the right context. This is where the researcher has to earn his or her money by adopting the correct procedure or explaining why they have adopted a certain route. I could suggest looking at the EVC and pagerank results of a directed model, then making it un-directed and running the calculations again. This should help you see the differences. I hope that answers your question.