-
- Murray Shanahan and Mark Wildie.
- Department of Computing, Imperial College London, London, United Kingdom. m.shanahan@imperial.ac.uk
- Plos One. 2012 Jan 1;7(5):e36579.
AbstractA 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.
Notes
Knowledge, pearl, summary or comment to share?You can also include formatting, links, images and footnotes in your notes
- Simple formatting can be added to notes, such as
*italics*,_underline_or**bold**. - Superscript can be denoted by
<sup>text</sup>and subscript<sub>text</sub>. - Numbered or bulleted lists can be created using either numbered lines
1. 2. 3., hyphens-or asterisks*. - Links can be included with:
[my link to pubmed](http://pubmed.com) - Images can be included with:
 - For footnotes use
[^1](This is a footnote.)inline. - Or use an inline reference
[^1]to refer to a longer footnote elseweher in the document[^1]: This is a long footnote..