RESUMO
Community detection plays a key role in the study of brain networks, as mechanisms of modular integration and segregation are known to characterize the brain functioning. Moreover, brain networks are intrinsically multilayer: they can vary across time, frequency, subjects, conditions, and meaning, according to different definitions of connectivity. Several algorithms for the multilayer community detection were defined to identify communities in time-varying networks. The most used one is based on the optimization of a multilayer formulation of the modularity, in which two parameters linked to the spatial (γ) and temporal (ω) resolution of the uncovered communities can be set. While the effect of different γ-values has been largely explored, which ω-values are most suitable to different purposes and conditions is still an open issue. In this work, we test the algorithm performances under different values of ω by means of ad hoc implemented benchmark graphs that cover a wide range of conditions. Results provide a guide to the choice of the ω-values according to the network features. Finally, we show an application of the algorithm to real functional brain networks estimated from electro-encephalographic (EEG) signals collected at rest with closed and open eyes. The application to real data agrees with the results of the simulation study and confirms the conclusion drawn from it.
Assuntos
Encéfalo , Algoritmos , Mapeamento Encefálico , Eletroencefalografia , TempoRESUMO
Community structure is a feature of complex networks that can be crucial for the understanding of their internal organization. This is particularly true for brain networks, as the brain functioning is thought to be based on a modular organization. In the last decades, many clustering algorithms were developed with the aim to identify communities in networks of different nature. However, there is still no agreement about which one is the most reliable, and to test and compare these algorithms under a variety of conditions would be beneficial to potential users. In this study, we performed a comparative analysis between six different clustering algorithms, analyzing their performances on a ground-truth consisting of simulated networks with properties spanning a wide range of conditions. Results show the effect of factors like the noise level, the number of clusters, the network dimension and density on the performances of the algorithms and provide some guidelines about the use of the more appropriate algorithm according to the different conditions. The best performances under a wide range of conditions were obtained by Louvain and Leicht & Newman algorithms, while Ronhovde and Infomap proved to be more appropriate in very noisy conditions. Finally, as a proof of concept, we applied the algorithms under exam to brain functional connectivity networks obtained from EEG signals recorded during a sustained movement of the right hand, obtaining a clustering of scalp electrodes which agrees with the results of the simulation study conducted.
Assuntos
Análise por Conglomerados , Algoritmos , Encéfalo , Eletroencefalografia , Couro CabeludoRESUMO
Deep brain stimulation is a clinical technique for the treatment of parkinson's disease based on the electric stimulation, through an implanted electrode, of specific basal ganglia in the brain. To identify the correct target of stimulation and to choose the optimal parameters for the stimulating signal, intraoperative microelectrodes are generally used. However, when they are replaced with the chronic macroelectrode, the effect of the stimulation is often very different. Here, we used numerical simulations to predict the stimulation of neuronal fibers induced by microelectrodes and macroelectrodes placed in different positions with respect to each other. Results indicate that comparable stimulations can be obtained if the chronic macroelectrode is correctly positioned with the same electric center of the intraoperative microelectrode. Otherwise, some groups of fibers may experience a completely different electric stimulation.