No retraction, correction or concern found when last checked on Oct 24, 2026.

The modular organization of human anatomical brain networks: Accounting for the cost of wiring

Richard F. Betzel, John D. Medaglia, Lia Papadopoulos and 6 more

Network Neuroscience · 2017

Abstract

Brain networks are expected to be modular. However, existing techniques for estimating a network’s modules make it difficult to assess the influence of organizational principles such as wiring cost reduction on the detected modules. Here we present a modification of an existing module detection algorithm that allowed us to focus on connections that are unexpected under a cost-reduction wiring rule and to identify modules from among these connections. We applied this technique to anatomical brain networks and showed that the modules we detected differ from those detected using the standard technique. We demonstrated that these novel modules are spatially distributed, exhibit unique functional fingerprints, and overlap considerably with rich clubs, giving rise to an alternative and complementary interpretation of the functional roles of specific brain regions. Finally, we demonstrated that, using the modified module detection approach, we can detect modules in a developmental dataset that track normative patterns of maturation. Collectively, these findings support the hypothesis that brain networks are composed of modules and provide additional insight into the function of those modules.

Full text

Its licence does not allow us to show the full text. Read it at PubMed Central:

References 130

1.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
2.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
3.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
4.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
5.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
6.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
7.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
8.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
9.
One Rule to Grow Them All: A General Theory of Neuronal Branching and Its Practical Application · 2010
No notice
10.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
11.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
12.
Finding Statistically Significant Communities in Networks · 2011
No notice
13.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
14.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
15.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
16.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
17.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
18.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
19.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
20.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
21.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
22.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
23.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
24.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
25.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
26.
Efficient Physical Embedding of Topologically Complex Information Processing Networks in Brains and Computer Circuits · 2010
No notice
27.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
28.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
29.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
30.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
31.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
32.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
33.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
34.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
35.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
36.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
37.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
38.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
39.
Identification and Classification of Hubs in Brain Networks · 2007
No notice
40.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library

All 130 references

Cited by papers we hold 5

Distance-dependent consensus thresholds for generating group-representative structural brain networks · 2019
No notice
Graph theory approaches to functional network organization in brain disorders: A critique for a brave new small-world · 2019
No notice
Diversity of meso-scale architecture in human and non-human connectomes · 2018
No notice
Positive affect, surprise, and fatigue are correlates of network flexibility · 2017
No notice
Cliques and cavities in the human connectome · 2017
No notice

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.