Evidence map›Paper›PMID 33800527›Full record

ArticleBrain sciences2021

The Graph of Our Mind.

Balázs Szalkai, Bálint Varga, Vince Grolmusz

Abstract read
In one paragraph

Article in Brain sciences, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.

0numbers the graph read from it
0cells of the map it votes in
11citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

11 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Review
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Balázs SzalkaiPIT Bioinformatics Group, Eötvös University, H-1117 Budapest, Hungary.
Bálint VargaPIT Bioinformatics Group, Eötvös University, H-1117 Budapest, Hungary.
Vince GrolmuszPIT Bioinformatics Group, Eötvös University, H-1117 Budapest, Hungary.ORCID 0000-0001-9456-8876

Funding

Mapping the Human Connectome: Structure, Function, and HeritabilityU54MH091657 · NIMH · WASHINGTON UNIVERSITY · PI UGURBIL, KAMIL, VAN ESSEN, DAVID C · 2010 to 2014
$34.7M
Nemzeti Kutatási Fejlesztési és Innovációs Hivatal EFOP-3.6.3-VEKOP-16-2017-00002NIMH NIH HHS U54 MH091657
6 · The paper itself

Abstract

Graph theory in the last two decades penetrated sociology, molecular biology, genetics, chemistry, computer engineering, and numerous other fields of science. One of the more recent areas of its applications is the study of the connections of the human brain. By the development of diffusion magnetic resonance imaging (diffusion MRI), it is possible today to map the connections between the 1-1.5 cm2 regions of the gray matter of the human brain. These connections can be viewed as a graph. We have computed 1015-vertex graphs with thousands of edges for hundreds of human brains from one of the highest quality data sources: the Human Connectome Project. Here we analyze the male and female braingraphs graph-theoretically and show statistically significant differences in numerous parameters between the sexes: the female braingraphs are better expanders, have more edges, larger bipartition widths, and larger vertex cover than the braingraphs of the male subjects. These parameters are closely related to the quality measures of highly parallel computer interconnection networks: the better expanding property, the large bipartition width, and the large vertex cover characterize high-quality interconnection networks. We apply the data of 426 subjects and demonstrate the statistically significant (corrected) differences in 116 graph parameters between the sexes.

Indexed as

braingraphconnectomesex differences

Identifiers

PMID33800527
PMCPMC7998275

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.