Eigenvector centrality

I am new to programming and I am trying to calculate the eigenvector centrality of an directed graph mapping onto a social network. These are large matrices. I know how to calculate eigenvectors and the adjacency matrix associated with th开发者_运维百科e graph. I am just unsure how to combine those two parts to calculate eigenvector centrality. Thanks in advance.

-Spencer

Say you have the nxn adjacency matrix for your graph of n nodes. Then you will need to calculate the eigenvector of this matrix associated with the largest eigenvalue. The centrality of the ith node is given by the ith element of this normalized eigenvector.
See http://113.212.161.150/elibrary/Library/Social_Network/Bonacich_Some.pdf and http://www.jstor.org/stable/2780000 for more background.