A network measure called knotty-centrality is defined that quantifies the extent to which a given subset of a graph’s nodes constitutes a densely intra-connected topologically central connective core. Using this measure, the knotty centre of a network is defined as a sub-graph with maximal knotty-centrality. A heuristic algorithm for finding subsets of a network with high knotty-centrality is presented, and this is applied to previously published brain structural connectivity data for the cat and the human, as well as to a number of other networks. The cognitive implications of possessing a connective core with high knotty-centrality are briefly discussed.
展开▼
