brainconn.centrality
.kcoreness_centrality_bu¶
-
kcoreness_centrality_bu
(CIJ)[source]¶ The k-core is the largest subgraph comprising nodes of degree at least k. The coreness of a node is k if the node belongs to the k-core but not to the (k+1)-core. This function computes the coreness of all nodes for a given binary undirected connection matrix.
Parameters: CIJ (NxN numpy.ndarray
) – binary undirected connection matrixReturns: - coreness ((N,)
numpy.ndarray
) – node coreness - kn ((N,)
numpy.ndarray
) – size of k-core
- coreness ((N,)