Knotty-Centrality: Finding the Connective Core of a Complex Network

Murray Shanahan and Mark Wildie

PLOS ONE, 2012, vol. 7, issue 5, 1-7

Abstract: 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.

Date: 2012
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0036579 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 36579&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0036579

DOI: 10.1371/journal.pone.0036579

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().