Exploring the disorders of brain effective connectivity network in ASD: A case study using EEG, transfer entropy, and graph theory

Author(s):  
Ali Dejman ◽  
Ali Khadem ◽  
Anahita Khorrami
IRBM ◽  
2021 ◽  
Author(s):  
Z. Wu ◽  
X. Chen ◽  
M. Gao ◽  
M. Hong ◽  
Z. He ◽  
...  

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
M. Lavanga ◽  
O. De Wel ◽  
A. Caicedo ◽  
K. Jansen ◽  
A. Dereymaeker ◽  
...  

In recent years, functional connectivity in the developmental science received increasing attention. Although it has been reported that the anatomical connectivity in the preterm brain develops dramatically during the last months of pregnancy, little is known about how functional and effective connectivity change with maturation. The present study investigated how effective connectivity in premature infants evolves. To assess it, we use EEG measurements and graph-theory methodologies. We recorded data from 25 preterm babies, who underwent long-EEG monitoring at least twice during their stay in the NICU. The recordings took place from 27 weeks postmenstrual age (PMA) until 42 weeks PMA. Results showed that the EEG-connectivity, assessed using graph-theory indices, moved from a small-world network to a random one, since the clustering coefficient increases and the path length decreases. This shift can be due to the development of the thalamocortical connections and long-range cortical connections. Based on the network indices, we developed different age-prediction models. The best result showed that it is possible to predict the age of the infant with a root mean-squared error (MSE) equal to 2.11 weeks. These results are similar to the ones reported in the literature for age prediction in preterm babies.


2014 ◽  
Vol 24 (6) ◽  
pp. 2979-2986
Author(s):  
Fernando Jorge-Hernandez ◽  
Yolanda Garcia Chimeno ◽  
Begonya Garcia-Zapirain ◽  
Alberto Cabrera Zubizarreta ◽  
Maria Angeles Gomez Beldarrain ◽  
...  

2020 ◽  
Vol 28 (3) ◽  
pp. 317-346
Author(s):  
Hannes Leitgeb

Abstract This is Part A of an article that defends non-eliminative structuralism about mathematics by means of a concrete case study: a theory of unlabeled graphs. Part A summarizes the general attractions of non-eliminative structuralism. Afterwards, it motivates an understanding of unlabeled graphs as structures sui generis and develops a corresponding axiomatic theory of unlabeled graphs. As the theory demonstrates, graph theory can be developed consistently without eliminating unlabeled graphs in favour of sets; and the usual structuralist criterion of identity can be applied successfully in graph-theoretic proofs. Part B will turn to the philosophical interpretation and assessment of the theory.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Peixin Zhao ◽  
Marjorie Darrah ◽  
Jim Nolan ◽  
Cun-Quan Zhang

This paper suggests a novel clustering method for analyzing the National Incident-Based Reporting System (NIBRS) data, which include the determination of correlation of different crime types, the development of a likelihood index for crimes to occur in a jurisdiction, and the clustering of jurisdictions based on crime type. The method was tested by using the 2005 assault data from 121 jurisdictions in Virginia as a test case. The analyses of these data show that some different crime types are correlated and some different crime parameters are correlated with different crime types. The analyses also show that certain jurisdictions within Virginia share certain crime patterns. This information assists with constructing a pattern for a specific crime type and can be used to determine whether a jurisdiction may be more likely to see this type of crime occur in their area.


Sign in / Sign up

Export Citation Format

Share Document