Skip to main content
Erschienen in: Cognitive Neurodynamics 6/2018

06.10.2018 | Research Article

Comparing advanced graph-theoretical parameters of the connectomes of the lobes of the human brain

verfasst von: Balázs Szalkai, Bálint Varga, Vince Grolmusz

Erschienen in: Cognitive Neurodynamics | Ausgabe 6/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Deep, classical graph-theoretical parameters, like the size of the minimum vertex cover, the chromatic number, or the eigengap of the adjacency matrix of the graph were studied widely by mathematicians in the last century. Most researchers today study much simpler parameters of braingraphs or connectomes which were defined in the last twenty years for enormous networks—like the graph of the World Wide Web—with hundreds of millions of nodes. Since the connectomes, describing the connections of the human brain, typically contain several hundred vertices today, one can compute and analyze the much deeper, harder-to-compute classical graph parameters for these, relatively small graphs of the brain. This deeper approach has proven to be very successful in the comparison of the connectomes of the sexes in our earlier works: we have shown that graph parameters, deeply characterizing the graph connectivity are significantly better in women’s connectomes than in men’s. In the present contribution we compare numerous graph parameters in the three largest lobes—frontal, parietal, temporal—and in both hemispheres of the human brain. We apply the diffusion weighted imaging data of 423 subjects of the NIH-funded Human Connectome Project, and present some findings, never described before, including that the right parietal lobe contains significantly more edges, has higher average degree, density, larger minimum vertex cover and Hoffman bound than the left parietal lobe. Similar advantages in the deep graph connectivity properties are held for the left frontal versus the right frontal and the right temporal versus the left temporal lobes.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Achterberg T (2009) SCIP: solving constraint integer programs. Math Programm Comput 1(1):01–41CrossRef Achterberg T (2009) SCIP: solving constraint integer programs. Math Programm Comput 1(1):01–41CrossRef
Zurück zum Zitat Achterberg T, Berthold T, Koch T, Wolter K (2008) Constraint integer programming: a new approach to integrate CP and MIP. In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Springer, pp 6–20 Achterberg T, Berthold T, Koch T, Wolter K (2008) Constraint integer programming: a new approach to integrate CP and MIP. In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Springer, pp 6–20
Zurück zum Zitat Chung FRK (1997) Spectral graph theory, vol 92. American Mathematical Society, Providence Chung FRK (1997) Spectral graph theory, vol 92. American Mathematical Society, Providence
Zurück zum Zitat Fields C, Glazebrook JF (2017) Disrupted development and imbalanced function in the global neuronal workspace: a positive-feedback mechanism for the emergence of asd in early infancy. Cogn Neurodyn 11(1):1–21CrossRefPubMed Fields C, Glazebrook JF (2017) Disrupted development and imbalanced function in the global neuronal workspace: a positive-feedback mechanism for the emergence of asd in early infancy. Cogn Neurodyn 11(1):1–21CrossRefPubMed
Zurück zum Zitat Gallai T (1959) Über extreme Punkt-und Kantenmengen. Ann. Univ. Sci. Budapest, Eötvös Sect. Math 2:133–138 Gallai T (1959) Über extreme Punkt-und Kantenmengen. Ann. Univ. Sci. Budapest, Eötvös Sect. Math 2:133–138
Zurück zum Zitat Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, New York Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, New York
Zurück zum Zitat Hoel PG (1984) Introduction to mathematical statistics, 5th edn. Wiley, New York Hoel PG (1984) Introduction to mathematical statistics, 5th edn. Wiley, New York
Zurück zum Zitat Hoffman AJ (1972) Eigenvalues and partitionings of the edges of a graph. Linear Algebra Appl 5(2):137–146CrossRef Hoffman AJ (1972) Eigenvalues and partitionings of the edges of a graph. Linear Algebra Appl 5(2):137–146CrossRef
Zurück zum Zitat Holm S (1979) A simple sequentially rejective multiple test procedure. Scand J Stat 6:65–70 Holm S (1979) A simple sequentially rejective multiple test procedure. Scand J Stat 6:65–70
Zurück zum Zitat Hoory S, Linial N, Wigderson A (2006) Expander graphs and their applications. Bull Am Math Soc 43(4):439–561CrossRef Hoory S, Linial N, Wigderson A (2006) Expander graphs and their applications. Bull Am Math Soc 43(4):439–561CrossRef
Zurück zum Zitat Kerepesi C, Szalkai B, Varga B, Grolmusz V (2017) The braingraph. org database of high resolution structural connectomes and the brain graph tools. Cogn Neurodyn 11(5):483–486CrossRefPubMedPubMedCentral Kerepesi C, Szalkai B, Varga B, Grolmusz V (2017) The braingraph. org database of high resolution structural connectomes and the brain graph tools. Cogn Neurodyn 11(5):483–486CrossRefPubMedPubMedCentral
Zurück zum Zitat Kirchhoff G (1847) Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird. Ann Phys Chem 72(12):497–508CrossRef Kirchhoff G (1847) Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird. Ann Phys Chem 72(12):497–508CrossRef
Zurück zum Zitat Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, Burlington Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, Burlington
Zurück zum Zitat Lovász L (2007) Combinatorial problems and exercises, 2nd edn. American Mathematical Society, Providence Lovász L (2007) Combinatorial problems and exercises, 2nd edn. American Mathematical Society, Providence
Zurück zum Zitat Szalkai B, Kerepesi C, Varga B, Grolmusz V (2015b) The Budapest Reference Connectome Server v2. 0. Neurosci Lett 595:60–62CrossRefPubMed Szalkai B, Kerepesi C, Varga B, Grolmusz V (2015b) The Budapest Reference Connectome Server v2. 0. Neurosci Lett 595:60–62CrossRefPubMed
Zurück zum Zitat Tarjan RE (1983) Data structures and network algorithms, volume 44 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial Applied Mathematics Tarjan RE (1983) Data structures and network algorithms, volume 44 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial Applied Mathematics
Zurück zum Zitat Tournier J, Calamante F, Connelly A (2012) Mrtrix: diffusion tractography in crossing fiber regions. Int J Imag Syst Technol 22(1):53–66CrossRef Tournier J, Calamante F, Connelly A (2012) Mrtrix: diffusion tractography in crossing fiber regions. Int J Imag Syst Technol 22(1):53–66CrossRef
Zurück zum Zitat White JG, Southgate E, Thomson JN, Brenner S (1986) The structure of the nervous system of the nematode caenorhabditis elegans: the mind of a worm. Philos Trans R Soc Lond 314:1–340CrossRef White JG, Southgate E, Thomson JN, Brenner S (1986) The structure of the nervous system of the nematode caenorhabditis elegans: the mind of a worm. Philos Trans R Soc Lond 314:1–340CrossRef
Zurück zum Zitat Wonnacott TH, Wonnacott RJ (1972) Introductory statistics. Wiley, New York Wonnacott TH, Wonnacott RJ (1972) Introductory statistics. Wiley, New York
Metadaten
Titel
Comparing advanced graph-theoretical parameters of the connectomes of the lobes of the human brain
verfasst von
Balázs Szalkai
Bálint Varga
Vince Grolmusz
Publikationsdatum
06.10.2018
Verlag
Springer Netherlands
Erschienen in
Cognitive Neurodynamics / Ausgabe 6/2018
Print ISSN: 1871-4080
Elektronische ISSN: 1871-4099
DOI
https://doi.org/10.1007/s11571-018-9508-y

Weitere Artikel der Ausgabe 6/2018

Cognitive Neurodynamics 6/2018 Zur Ausgabe

Neuer Inhalt