%0 Generic %A Mäki-Marttunen, Tuomo %A Aćimović, Jugoslava %A Ruohonen, Keijo %A Linne, Marja-Leena %D 2013 %T Structure-Dynamics Relationships in Bursting Neuronal Networks Revealed Using a Prediction Framework %U https://plos.figshare.com/articles/dataset/_Structure_Dynamics_Relationships_in_Bursting_Neuronal_Networks_Revealed_Using_a_Prediction_Framework_/754895 %R 10.1371/journal.pone.0069373 %2 https://ndownloader.figshare.com/files/1130748 %2 https://ndownloader.figshare.com/files/1130749 %2 https://ndownloader.figshare.com/files/1130750 %2 https://ndownloader.figshare.com/files/1130751 %2 https://ndownloader.figshare.com/files/1130752 %2 https://ndownloader.figshare.com/files/1130753 %2 https://ndownloader.figshare.com/files/1130754 %K Computational biology %K computational neuroscience %K Circuit models %K neuroscience %K neural networks %K Applied mathematics %K algorithms %K Probability theory %K Events (probability theory) %K Probability density %K Probability distribution %K Stochastic processes %K relationships %K bursting %K neuronal %K networks %K revealed %X

The question of how the structure of a neuronal network affects its functionality has gained a lot of attention in neuroscience. However, the vast majority of the studies on structure-dynamics relationships consider few types of network structures and assess limited numbers of structural measures. In this in silico study, we employ a wide diversity of network topologies and search among many possibilities the aspects of structure that have the greatest effect on the network excitability. The network activity is simulated using two point-neuron models, where the neurons are activated by noisy fluctuation of the membrane potential and their connections are described by chemical synapse models, and statistics on the number and quality of the emergent network bursts are collected for each network type. We apply a prediction framework to the obtained data in order to find out the most relevant aspects of network structure. In this framework, predictors that use different sets of graph-theoretic measures are trained to estimate the activity properties, such as burst count or burst length, of the networks. The performances of these predictors are compared with each other. We show that the best performance in prediction of activity properties for networks with sharp in-degree distribution is obtained when the prediction is based on clustering coefficient. By contrast, for networks with broad in-degree distribution, the maximum eigenvalue of the connectivity graph gives the most accurate prediction. The results shown for small () networks hold with few exceptions when different neuron models, different choices of neuron population and different average degrees are applied. We confirm our conclusions using larger () networks as well. Our findings reveal the relevance of different aspects of network structure from the viewpoint of network excitability, and our integrative method could serve as a general framework for structure-dynamics studies in biosciences.

%I PLOS ONE