Each node then splits its influence evenly and divides it amongst its outward neighbors , receiving from its inward neighbors in kind .
An intuitive process to compute eigenvector centrality is to give every node a starting random positive amount of influence .
Each node then splits node 's influence evenly and divides it amongst its outward neighbors , receiving from its inward neighbors in kind .
An intuitive process to compute eigenvector centrality is to give every node a starting random positive amount of influence .