brainconn.centrality.kcoreness_centrality_bd

kcoreness_centrality_bd(CIJ)

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 k-coreness of all nodes for a given binary directed connection matrix.

Parameters:CIJ (NxN numpy.ndarray) – binary directed connection matrix Returns:

• coreness ((N,) numpy.ndarray) – node coreness
• kn ((N,) numpy.ndarray) – size of k-core