brainconn.centrality
.eigenvector_centrality_und¶
-
eigenvector_centrality_und
(CIJ)[source]¶ Eigenector centrality is a self-referential measure of centrality: nodes have high eigenvector centrality if they connect to other nodes that have high eigenvector centrality. The eigenvector centrality of node i is equivalent to the ith element in the eigenvector corresponding to the largest eigenvalue of the adjacency matrix.
Parameters: - CIJ (NxN
numpy.ndarray
) – binary/weighted undirected adjacency matrix - v (Nx1
numpy.ndarray
) – eigenvector associated with the largest eigenvalue of the matrix
- CIJ (NxN