Skip to main content
PLOS ONE logoLink to PLOS ONE
. 2014 Feb 19;9(2):e87636. doi: 10.1371/journal.pone.0087636

Granger Causality Network Reconstruction of Conductance-Based Integrate-and-Fire Neuronal Systems

Douglas Zhou 1,*, Yanyang Xiao 1, Yaoyu Zhang 1, Zhiqin Xu 1, David Cai 1,2,3,*
Editor: Daniele Marinazzo4
PMCID: PMC3929548  PMID: 24586285

Abstract

Reconstruction of anatomical connectivity from measured dynamical activities of coupled neurons is one of the fundamental issues in the understanding of structure-function relationship of neuronal circuitry. Many approaches have been developed to address this issue based on either electrical or metabolic data observed in experiment. The Granger causality (GC) analysis remains one of the major approaches to explore the dynamical causal connectivity among individual neurons or neuronal populations. However, it is yet to be clarified how such causal connectivity, i.e., the GC connectivity, can be mapped to the underlying anatomical connectivity in neuronal networks. We perform the GC analysis on the conductance-based integrate-and-fire (IInline graphicF) neuronal networks to obtain their causal connectivity. Through numerical experiments, we find that the underlying synaptic connectivity amongst individual neurons or subnetworks, can be successfully reconstructed by the GC connectivity constructed from voltage time series. Furthermore, this reconstruction is insensitive to dynamical regimes and can be achieved without perturbing systems and prior knowledge of neuronal model parameters. Surprisingly, the synaptic connectivity can even be reconstructed by merely knowing the raster of systems, i.e., spike timing of neurons. Using spike-triggered correlation techniques, we establish a direct mapping between the causal connectivity and the synaptic connectivity for the conductance-based IInline graphicF neuronal networks, and show the GC is quadratically related to the coupling strength. The theoretical approach we develop here may provide a framework for examining the validity of the GC analysis in other settings.

Introduction

The relation between structure and function is one of the central research themes in biology. In order to fully understand the function of biological organisms, it is often important to analyze the structure of the systems [1][3]. The characterization of structure can be different with respect to the scales one is interested in. On the molecular level, the structure may refer to microscopic configurations of atoms, e.g., in hierarchical protein folding. Whereas, at the system level, such as neuronal circuitry, the structure often refers to the anatomical connections amongst neurons. To find the wiring diagram, i.e., synaptic connectivity, is often regarded as a key step towards understanding of the information processing and function of the brain [4][6]. New experimental observation tools, such as diffusion tensor imaging, are useful to tract fiber pathways in the whole brain, however, they usually have an insufficient spatial resolution and cannot be used to infer connections at the cellular level. Systematic assessment of global network synaptic connectivity through direct electrophysiological assays has remained technically infeasible, even for some simple systems such as dissociated neuronal culture [7][9]. However, it is relatively easy in experiment to obtain dynamical activities of neuronal populations or individual neurons through, e.g., local field potential, spike trains measurement, magnetoencephalography (MEG), electroencepholography (EEG), or functional magnetic resonance imaging (fMRI). Based on experimentally measured data, many network analysis approaches have been developed in attempt to probe the underlying brain connectivity through various statistical approaches [10][13], such as Granger causality [14][16] and dynamic Bayesian inference [17], [18]. Through these analyses, the obtained connectivity is often referred to as functional or effective connectivity [19]. However, such functional (effective) connectivity obtained from different computational analysis is often different from one another [20], [21]. Conceptually, they are also different from the structural (synaptic) connectivity. To infer the underlying network structure from observation, it is desirable to explore the relationship between structural and functional connectivity [22][25]. Understanding of how the functional connectivity is mapped to the anatomical synaptic connectivity in the brain remains one of the major challenges in systems neuroscience [26][29].

In this work, we study the relationship between structural connectivity and a particular functional connectivity which we will describe presently for conductance-based integrate-and-fire (IInline graphicF) neuronal networks. It has been shown in experiment that IInline graphicF models can statistically faithfully capture the response of cortical neurons under in-vivo-like currents in terms of both firing dynamics and subthreshold membrane dynamics [30][33]. In theoretical and computational neuroscience, the conductance-based IInline graphicF neuron has served as an efficient reduced model of cortical neurons to study their statistical spike-encoding properties [34], [35]. For instance, the IInline graphicF neuron has been widely used as basic neuronal units for modeling large-scale cortical dynamics to investigate information processing in certain areas of the brain [36][42]. In our study, the structural connectivity of IInline graphicF networks denotes synaptic connections between neurons, which are characterized by the adjacency matrix of the network. The particular functional connectivity of IInline graphicF networks in our work denotes the connectivity constructed by the Granger causality (GC) analysis. The notion of GC was originally introduced by Wiener to determine causal influence from one dynamical variable Inline graphic to the other Inline graphic [43]. It was further mathematically formulated using linear regression/prediction models [43][45]. In this framework, if the prediction of Inline graphic can be improved by incorporating the information in the history of Inline graphic, it is said that there exists a causal connection from the time series Inline graphic to Inline graphic. Due to its simplicity and easy implementation, the GC theory has been extensively applied to study the functional connectivity of networks in neuroscience as well as in other scientific fields such as systems biology, medical engineering, economics, and social science [14], [46]. By using voltage or spike train time series obtained from the IInline graphicF network dynamics, the functional connectivity of IInline graphicF networks can be obtained from the GC analysis, which we will term as the GC connectivity, and describe this connectivity by the causal adjacency matrix.

The main theoretical issue we address in this work is whether we can establish a direct, quantitative mapping between the structural connectivity and the GC connectivity for IInline graphicF neuronal networks. That is, whether the underlying structural connectivity, which is usually not easy to assess in experiment, can be extracted by using the GC analysis. There are several challenges in this task: (i) the GC theory is based on linear regression models and assumes that the causal relationship can be well captured by low order statistics (up to the variance) of signals, e.g., Gaussian time series [47]. Theoretically, it has yet to determine whether the linear GC framework is applicable to IInline graphicF systems, whose dynamics are nonlinear and non-smooth; (ii) the notion of GC connectivity is statistical rather than structural, i.e., quantification of directed statistical correlation between dynamical elements, whereas the structural connectivity corresponds to physical connections between dynamical units. A priori, there is no obvious reason that these two types of connectivity are always identical to each other [9], [21], [48]. For instance, there were indications that strong effective connections could exist between regions with no direct structural connections [23], [49], [50] and the functional connectivity could vary under different dynamical states associated with the same structural network [3], [51].

We first develop a reliable numerical algorithm for obtaining the GC connectivity of IInline graphicF networks. Through numerical studies, we show that the GC connectivity is highly coincident with the structural connectivity, i.e., the synaptic connectivity between neurons in a network can be well reconstructed by the causal connectivity obtained from the GC analysis on voltage time series. We point out that this reconstruction can be achieved despite the fact that the dynamics of IInline graphicF networks are both nonlinear and non-smooth. As demonstrated in our numerical results, this reconstruction is quite robust as long as the time series are reasonably long for the system to reach a statistically steady state. The reconstruction is also insensitive to the system size and is independent of dynamical regimes. We then investigate the theoretical underpinning of this network reconstruction by means of the spike-triggered correlation (STC) approach. Our analysis shows that the STC on voltage time series, often a standard method used for inference of connectivity in experiment [52], [53], cannot capture the correct inference of the underlying synaptic connections between neurons. This failure has to do with the fact that voltage signals usually have a finite autocorrelation time. We further show that the STC on voltage-signal residuals, i.e., whitened signals obtained from regression models, is able to link the GC connectivity and the structural connectivity of the network. This is achieved by first establishing the structure of STC on residuals to reflect the underlying coupling between neurons, then showing this STC is linearly related to residual cross-correlations. Further, by solving the Yule-Walker equations with respect to residuals, we can obtain a relation between GC and the residual cross-correlations for the IInline graphicF networks, thus connecting GC to the underlying coupling between neurons through STC on residuals. In addition, we can obtain the relationship that GC for neuron Inline graphic to neuron Inline graphic is proportional to Inline graphic, where Inline graphic is the synaptic coupling strength from neuron Inline graphic to neuron Inline graphic.

To investigate the range of applicability of our method, we further demonstrate that the GC analysis is also capable of detecting synaptic connections between individual neurons and a subnetwork of neurons (i.e., a group of interacting neurons), or connections between subnetworks. This is motivated by the signals measured by extracellular recordings in experiment, i.e., the local field potential. Our results indicate that the synaptic connection may also be detected from measured signals between intracellular (individual neuron) and extracellular recordings (a group of neurons, i.e., subnetworks). In addition, we show that the network reconstruction through the GC theory can also be achieved using spike train time series. In comparison with the precise voltage-trace measurement, we note that spike train time series are relatively easy to measure in experiment, thus, rendering spike-train GC analysis particularly useful for practical settings. This is rather striking in that one can essentially reconstruct the synaptic connectivity of IInline graphicF networks by only examining the raster plot of a group of neurons. In addition, we also demonstrate that our reconstruction can be extended to networks with both excitatory and inhibitory neurons, or to more realistic neuronal networks, e.g., of the exponential IInline graphicF neurons. Note that our results provide a direct link between the GC connectivity and the structural connectivity with no intervention of systems and no prior knowledge of neuronal model parameters. Therefore, this method may be potentially useful in experiment to infer the structural information of neuronal networks. Because the GC theory is often used to investigate the direction of information flow within networks, our work may also shed light on how propagation of information flow within networks can be influenced by the network topology.

Results

The systems we study are conductance-based, integrate-and-fire type neuronal networks [See Eqs. (23), (24) and (25) in Methods ]. As mentioned previously, with in-vivo-like current injection, the IInline graphicF neuronal model can capture well both the firing rate and subthreshold dynamics of cortical neurons [30], [31]. Consequently, networks of IInline graphicF neurons have served as prototypical theoretical models to provide insight into fascinating dynamics of many neuronal networks in the brain [32], [33], [35], [54].

The Granger causality characterizes causal interactions between time series by distinguishing the driver from the recipient (See theoretical definitions in Methods ), namely, the driver, which is earlier than the recipient, contains information about the future of the recipient, and thus the variance of the prediction error is reduced when the information of the driver is incorporated. In general, the causal influence between time series reflects a drive-response scenario and this influence can be either reciprocal or unidirectional. As discussed later, such causality which is based on temporality is characterized by the directional correlation relations between time series.

We apply the Granger causality analysis to these widely used IInline graphicF neuronal networks to investigate the relationship between causal and structural connectivities (See GC algorithm in Methods ). By applying the GC algorithm to the IInline graphicF networks, we can obtain all the GC values from neuron Inline graphic to neuron Inline graphic, denoted by Inline graphic, for Inline graphic, Inline graphic,Inline graphic. Then, we perform the p-value test (Inline graphic in our simulations) to determine a GC threshold Inline graphic (See Text S1 for more details). If Inline graphic, we define that there is a significant causal interaction from the Inline graphicth neuron to the Inline graphicth neuron and denote this by Inline graphic. Otherwise, we say there is no causal influence from the Inline graphicth neuron to the Inline graphicth neuron and denote this by Inline graphic. Because GC interactions between two neurons are in general not symmetric, by representing them as edges in a graph, we can define a directed graph or a causal connectivity network, as characterized by the matrix Inline graphic, for the IInline graphicF systems [55], [56]. Meanwhile, the structural connectivity of our IInline graphicF system is characterized by the synaptic adjacency matrix, denoted by Inline graphic (See Methods ). Note that, the causal connectivity can be viewed as a type of functional connectivity [19], [29], whereas the structural connectivity reflects physical connectivity. As discussed in the Introduction , our causal connectivity is a statistical measure, and it is, in general, not equivalent to the underlying physical connections between dynamical variables [56].

Causal connectivity vs. structural connectivity for I&F networks

As described above, the GC connectivity can be characterized by the causal adjacency matrix Inline graphic, whereas the structural connectivity is characterized by the synaptic adjacency matrix Inline graphic, Inline graphic. In the following, we discuss the relationship between Inline graphic and Inline graphic for the IInline graphicF networks, i.e., the relationship between GC connectivity and structural connectivity.

Figure 1A and C shows examples of synaptic connectivity Inline graphic between neurons for a two-neuron and a three-neuron networks. Figure 1B and D displays the corresponding causal adjacency matrix Inline graphic constructed by using our GC algorithm on the voltage time series. It can be clearly seen that the causal connectivity is coincident with the synaptic connectivity. These examples present compelling evidence that the synaptic adjacency matrix of the IInline graphicF networks can be successfully reconstructed by using the GC algorithm on neurons' voltage trajectories.

Figure 1. GC connectivity for small excitatory networks.

Figure 1

For networks of two excitatory neurons and three excitatory neurons in (A) and (C), the edge with only a triangle at the end signifies a directed connectivity. Parameters in (A)-(D) are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (the corresponding EPSP is Inline graphicmV). (A) A two-neuron network with only a synaptic connection from neuron Inline graphic to neuron Inline graphic. (B) Causal adjacency matrix Inline graphic constructed by GC, which captures the synaptic connectivity in (A). (C) A three-neuron network with a synaptic connection from neuron Inline graphic to neuron Inline graphic and with bidirectional synaptic connections between neuron Inline graphic and neuron Inline graphic. (D) Causal adjacency matrix Inline graphic constructed by GC, which captures the synaptic connectivity in (C). The coincidence between the synaptic adjacency matrix Inline graphic and the causal adjacency matrix Inline graphic as a function of rate Inline graphic and magnitude Inline graphic in the Poisson drive for (E) the two-neuron network as shown in (A), and (F) the three-neuron network as shown in (C). The parameter region labeled by the white color indicates that Inline graphic, and by the black color indicating that Inline graphic.

Next, we address the question of whether these successful reconstructions are merely accidental cases or whether there is a large class of networks that are amenable to this analysis. To examine whether the reconstruction is dependent on particular dynamical regimes, which are often described by a particular choice of network system parameters, we investigate the robustness of the reconstruction by scanning the magnitude Inline graphic and the rate Inline graphic in the Poisson drive of the IInline graphicF networks [See Eq. (23) in Methods ]. The choice of these parameters covers the realistic firing rates (Inline graphicHz) of real neurons [35], [57]. Note that there are typically three dynamical regimes for the IInline graphicF neurons for each fixed input strength Inline graphic: (i) a highly fluctuating regime when the input rate Inline graphic is low; (ii) an intermediate regime when Inline graphic is moderately high; (iii) a low fluctuating or mean driven regime when Inline graphic is very high [58], [59]. Figure 2A–C shows the voltage trajectories of two neurons for different choices of input rate Inline graphic with the input strength Inline graphic fixed. It can be seen from Fig. 2A–C that the firing pattern is rather irregular when Inline graphic is low (Inline graphic), whereas the spiking activity of neurons becomes relatively regular (nearly periodic) when Inline graphic is very high (Inline graphic). For all these dynamical regimes, we can demonstrate that there is a wide range of the network parameters whose synaptic connectivity can be analyzed using the GC analysis. As shown in Fig. 1E and F, the GC connectivity (Inline graphic) and the synaptic connectivity Inline graphic are highly coincident with each other for both two-neuron and three-neuron networks over a wide range of dynamical regimes.

Figure 2. Characteristics of different dynamical regimes.

Figure 2

Illustrated here are the dynamic characteristics of the two-excitatory-neuron network in Fig. 1A with different Poisson input rate Inline graphic for highly fluctuating regime [(A),(D),(G),(J) and (M)] with Inline graphic, intermediate regime [(B),(E),(H),(K) and (N)] with Inline graphic and mean-driven regime [(C),(F),(I),(L) and (O)] with Inline graphic. The fixed input strength Inline graphic. For these three dynamical regimes, we plot the corresponding quantities: (A), (B), and (C) are voltage trajectories Inline graphic (black online) and Inline graphic (red online). (D), (E), and (F) are spike-triggered correlation on voltage [Eq. (1)]: Inline graphic (cyan online) and Inline graphic (black online). (G), (H), and (I) are spike-triggered correlation on residuals [Eq. (2)]: Inline graphic (cyan online) and Inline graphic (black online). (J), (K), and (L) are numerically computed regression coefficients Inline graphic (blue “plus” online), Inline graphic (red “cross” online) and their corresponding approximations Inline graphic (“square” symbol), Inline graphic (“circle” symbol). (M), (N), and (O) are the GC Inline graphic (red “star” online) as a function of coupling strength Inline graphic, the line (black online) is a quadratic fit.

We further examine whether the synaptic connectivity of large networks with multiple neurons can be revealed by the GC connectivity analysis. For a network of Inline graphic neurons with random connectivity, its synaptic adjacency matrix (Inline graphic) is shown in Fig. 3A, where the total number of nonzero Inline graphic, as indicated by the black color, is approximately Inline graphic. Applying the GC analysis to this network, we can construct its causal connectivity matrix Inline graphic. Figure 3B shows the difference between Inline graphic and Inline graphic, where the white color represents Inline graphic, i.e., Inline graphic, and the black color represents Inline graphic. It can be seen that the synaptic adjacency matrix Inline graphic can be successfully reconstructed by the causal adjacency matrix Inline graphic with very high accuracy (Inline graphic). Incidentally, we also point out an interesting phenomenon as observed for the GC connectivity of large excitatory neuronal networks: if we rank the GC by magnitude for all possible directed connections between neurons, there often is a gap separating these ranked GC values as indicated by the gray horizontal line (blue online) in Fig. 3C. This gap clearly divides the GC values into two distinct groups. Surprisingly, by using this gap, for example, by choosing a horizontal line within the gap as the GC threshold Inline graphic, we obtain that Inline graphic is identical to Inline graphic.

Figure 3. GC connectivity for large excitatory networks.

Figure 3

For an IInline graphicF network of 100 excitatory neurons with random connectivity, the synaptic adjacency matrix Inline graphic is shown in (A) with the white color indicating that Inline graphic and the black color for Inline graphic. The total number of nonzero Inline graphic is Inline graphic (the percentage of connections is Inline graphic) and the average neuronal firing rate is Inline graphicHz. (B) The absolute difference between Inline graphic and the causal adjacency matrix Inline graphic, i.e., Inline graphic. The white color indicates that Inline graphic, i.e., Inline graphic and the black color when Inline graphic. By significance test (Inline graphic, See Text S1 for more details), the total number of Inline graphic is Inline graphic out of Inline graphic possible pairs of connections. (C) Ranked GC in order of magnitude with the horizontal line (blue online) indicating a threshold in the gap of the ranked GC. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (the corresponding EPSP is Inline graphicmV).

Mechanism underlying the successful reconstruction

In this section, we address the issue of why the GC framework, based on linear systems, can be used to reveal the synaptic connectivity of nonlinear network dynamics of IInline graphicF neurons. For dynamical systems of pulse-coupled type, such as IInline graphicF neurons, the spike-triggered correlation (STC) or spike-triggered averaging method has been widely applied in studies of synaptic connections in such systems [52], [60]. The STC on voltages from the Inline graphicth neuron to the Inline graphicth neuron is defined as

graphic file with name pone.0087636.e156.jpg (1)

where Inline graphic has zero mean, Inline graphic is the Inline graphicth spike time of the Inline graphicth neuron as defined in Eq. (23) (See Methods ) and Inline graphic is the average with respect to Inline graphic, i.e., average over all spikes of the Inline graphicth neuron. Note that, the STC contains the information of both the statistics of the spike drive from the Inline graphicth neuron and the response of the Inline graphicth neuron [52], [60]. Therefore, this drive-response scenario apparently reflects the causal connectivity from the Inline graphicth neuron to the Inline graphicth neuron. On the other hand, the existence of this drive-response relation might imply the existence of synaptic connectivity from the Inline graphicth neuron to the Inline graphicth neuron, i.e., Inline graphic. Therefore, it appears that the feature of STC on voltage can be used to relate the causal connectivity to the synaptic connectivity for the IInline graphicF network system.

For the two-neuron network in Fig. 1A, the STCs on voltages between neuron Inline graphic and neuron Inline graphic [Inline graphic and Inline graphic] in the three different dynamical regimes are displayed in Fig. 2D–F. From the definition of STC [Eq. (1)], if the Inline graphicth neuron's response Inline graphic, averaged over all the spikes of the Inline graphicth neuron, exhibits significant deviations from zero when Inline graphic, it might imply that the Inline graphicth neuron is presynaptic to the Inline graphicth neuron, otherwise Inline graphic should be nearly zero after statistical average [52], [60], [61]. However, as shown in Fig. 2D–F, both STCs, Inline graphic and Inline graphic, exhibit significant deviations from zero for Inline graphic when Inline graphic is small and naturally vanish when Inline graphic is sufficiently large in all dynamical regimes shown in Fig. 2A–C. These nonzero features in STCs, Inline graphic and Inline graphic, may suggest that the connections between two neurons are bidirectional [61], [62]. However, from the network synaptic connectivity as shown in Fig. 1A, there is only a unidirectional synaptic connection from neuron Inline graphic to neuron Inline graphic. Therefore, one needs to address the question of why the STC Inline graphic, similarly Inline graphic, exhibit nonzero features for Inline graphic despite the fact that there is no synaptic connection from neuron 2 to neuron 1. Intuitively, we can understand the phenomenon as follows: because the voltage signal Inline graphic is not white, i.e., there is a finite correlation time for the voltage signal, the future of Inline graphic will be correlated with its own history. On the other hand, neuron Inline graphic is presynaptic to the neuron Inline graphic, thus giving rise to the possibility that Inline graphic is also correlated with the history of Inline graphic. Therefore, Inline graphic would be likely correlated with the future of Inline graphic. This correlation is reflected in the nonzero feature of the STC Inline graphic for Inline graphic, and it can give rise to an incorrect inference of the synaptic connection from neuron Inline graphic to neuron Inline graphic.

From the above argument, the nonzero feature of the STC Inline graphic is closely related to the finite-time autocorrelation structure of voltage signals. This has led us to investigate the STC on signals without finite-time autocorrelations, i.e., whitened signals, in order to extract correct synaptic connectivity between neurons. Note that, the residuals Inline graphic and Inline graphic, as obtained in auto regression (AR) models [See Eq. (17) in Methods ], are whitened signals [44], [45], i.e., with only instantaneous correlation. Therefore, we may study the STC on residuals Inline graphic and Inline graphic:

graphic file with name pone.0087636.e212.jpg (2)

As shown in Fig. 2G–I, for Inline graphic, the STC Inline graphic possesses similar features to that of the STC Inline graphic, indicating the existence of synaptic connectivity from neuron Inline graphic to neuron Inline graphic. However, unlike the STC Inline graphic, the STC Inline graphic statistically vanishes for Inline graphic, suggesting that neuron Inline graphic is not presynaptic to neuron Inline graphic. These results indicate that the STC on residuals, i.e., whitened signals, can provide a correct inference about the unidirectional connection between the two neurons.

As the STC on residuals may be used to successfully detect the synaptic connectivity between neurons, it is natural to ask whether the GC connectivity between the signals of residuals are related to the underlying mechanism for the success of the reconstruction of networks. From the AR models for Inline graphic and Inline graphic [See Eq. (17) in Methods ], we can construct the moving average representations of Inline graphic, Inline graphic in terms of residuals Inline graphic, Inline graphic [63], [64].

graphic file with name pone.0087636.e229.jpg (3)

where Inline graphic and Inline graphic are constant coefficients. Then, substituting Eq. (3) into the joint regression (JR) models for Inline graphic and Inline graphic [See Eq. (18) in Methods ], we obtain the corresponding JR models for Inline graphic and Inline graphic:

graphic file with name pone.0087636.e236.jpg (4a)
graphic file with name pone.0087636.e237.jpg (4b)

where Inline graphic and Inline graphic are the same residuals as those in the original JR models for Inline graphic and Inline graphic [See Eq. (18) in Methods ]. Note that Eqs. (4a) and (4b) can also be obtained by using the least-squares method. On the other hand, we can construct the AR models for Inline graphic and Inline graphic as

graphic file with name pone.0087636.e244.jpg (5)

Eqs. (4) and (5) represent JR and AR processes for residuals Inline graphic and Inline graphic, respectively. By the definition of GC, we can obtain Inline graphic and Inline graphic. Note that the residuals Inline graphic and Inline graphic are whitened signals. Therefore, the coefficients Inline graphic, Inline graphic in the AR models (5) are zero and we have Inline graphic, Inline graphic. This yields that the GC is invariant as

graphic file with name pone.0087636.e255.jpg (6)

From Eq. (6), it can be seen that the causal connectivity is indeed embedded in the whitened residuals Inline graphic and Inline graphic. In the following, we will show how the STC on residuals bridges the causal connectivity and the synaptic connectivity.

We first derive analytical expressions of GC for the IInline graphicF networks and show that they are closely related to the residual cross-correlation between Inline graphic and Inline graphic. Multiplying Eq. (4a) by the residual Inline graphic or Inline graphic, for Inline graphic, Inline graphic, Inline graphic, and taking expectations, we obtain the Yule-Walker equations [63], [64] with respect to the coefficients Inline graphic and Inline graphic as

graphic file with name pone.0087636.e268.jpg (7)

where Inline graphic is the covariance matrix with Inline graphic. The column vectors Inline graphic, Inline graphic and Inline graphic, for Inline graphic, Inline graphic, where Inline graphic, Inline graphic and Inline graphic are the Inline graphicth component in the vectors. Similarly, if we multiply Eq. (4b) by the residual Inline graphic or Inline graphic, for Inline graphic, Inline graphic, Inline graphic, and take expectations, then we can obtain the Yule-Walker equations with respect to coefficients Inline graphic and Inline graphic

graphic file with name pone.0087636.e287.jpg (8)

where the column vectors Inline graphic, Inline graphic and Inline graphic, for Inline graphic, Inline graphic, where Inline graphic, Inline graphic and Inline graphic are the Inline graphicth component in the vectors. Solving Eqs. (7) and (8), we obtain the regression coefficients as

graphic file with name pone.0087636.e297.jpg (9)

where the matrices Inline graphic and Inline graphic are defined as Inline graphic and Inline graphic with Inline graphic being the identity matrix.

As mentioned previously, Eqs. (4) can also be obtained by using the least-squares method. From this viewpoint, by multiplying Eq. (4a) by Inline graphic and Eq. (5) by Inline graphic, then taking expectations, we can obtain

graphic file with name pone.0087636.e305.jpg (10)

Substituting Eqs. (9) into Eqs. (10) and using the GC definition [See Eqs. (19) in Methods ], we arrive at

graphic file with name pone.0087636.e306.jpg (11)

For small residual cross-correlation between Inline graphic and Inline graphic, which is consistent with our numerical simulation results for the IInline graphicF networks, namely, Inline graphic with Inline graphic, Inline graphic chosen as any integers, the matrices Inline graphic and Inline graphic can both be approximated by Inline graphic. Therefore, the regression coefficients Inline graphic and Inline graphic in Eqs. (9) can be approximated by

graphic file with name pone.0087636.e318.jpg (12)

As verified numerically in Fig. 2J–L, Eqs. (12) provide very good approximations of the regression coefficients Inline graphic and Inline graphic for the IInline graphicF networks. We observe that Inline graphic and Inline graphic as shown in Fig. 2J–L. From the GC theory [43][45], a vanishing Inline graphic indicates there is no causal influence from neuron Inline graphic to neuron Inline graphic, whereas a nonvanishing Inline graphic indicates there is a causal influence from neuron Inline graphic to neuron Inline graphic. This causal connectivity is consistent with the underlying synaptic connectivity. By definition, the residual cross-correlation Inline graphic reflects the correlation between the future of neuron Inline graphic [as embedded in Inline graphic] and the history of neuron Inline graphic [as embedded in Inline graphic], whereas Inline graphic reflects the correlation between the future of neuron Inline graphic and the history of neuron Inline graphic. Therefore, Inline graphic and Inline graphic characterize the drive-response relationship between two neurons, as also captured by the regression coefficients Inline graphic and Inline graphic in JR models through Eqs. (12). Furthermore, the GC between two neurons [Eq. (11)] can be approximated by

graphic file with name pone.0087636.e342.jpg (13)

which provide a relation between the GC and the residual cross-correlations.

Next, we establish the relationship between the STC on residuals and their cross-correlations. Due to the firing-reset dynamics of IInline graphicF neurons, the magnitude of Inline graphic (Inline graphic) at each Inline graphicth spike time Inline graphic (Inline graphic) is much larger in absolute value than that at other times as can be seen from Fig. 4. Therefore, the residuals Inline graphic and Inline graphic can be approximated in the form of the Dirac delta functions as Inline graphic, Inline graphic, where Inline graphic and Inline graphic are normalizing factors. Under this approximation, the STC on residuals [Eq. (2)] can be expressed as

graphic file with name pone.0087636.e355.jpg (14)

where Inline graphic and Inline graphic are the firing rate of neuron Inline graphic and neuron Inline graphic, respectively. From Eqs. (13) and (14), it can be seen that the GC Inline graphic is equivalent to the STC on residual Inline graphic, and Inline graphic is equivalent to the STC on residual Inline graphic for Inline graphic. Therefore, the causal connectivity can be well extracted by the nonzero feature of STC on residuals. Note that, as discussed previously, the nonzero feature of STC on residuals is related to the pre-post synaptic connectivity between neurons as shown in Fig. 2G–I. Therefore, we can conclude that the causal connectivity captures well the synaptic connectivity for the IInline graphicF networks.

Figure 4. Trajectories of voltages and residuals.

Figure 4

For the two-excitatory-neuron network in Fig. 1A, illustrated here are the sample trajectories of voltages in (A) Inline graphic (black online) and Inline graphic (red online), and corresponding trajectories of residuals in (B) Inline graphic (black online) and Inline graphic (red online).

Finally, we discuss the relation between GC and the coupling strength Inline graphic when there exists a synaptic connection between two neurons. Note that the STC Inline graphic corresponds to the spike-induced change of Inline graphic. From the IInline graphicF system [e.g., See Eq. (23) in Methods ], this change is asymptotically proportional to the coupling strength Inline graphic when Inline graphic is small. Therefore, combined with Eqs. (13) and (14), we can make a connection that GC is quadratically related to the coupling strength as

graphic file with name pone.0087636.e376.jpg (15)

Fig. 2M–O shows that, in three different dynamical regimes, there is an approximately quadratic relation between GC and the coupling strength, confirming the relationship in Eq. (15). Note that the two-neuron network we discussed above is for the unidirectional case. However, the above analytical derivations are still valid for the case of bidirectional connections.

It is worthwhile to emphasize that it is the Inline graphic-like noise structure of residuals, induced by the firing-reset dynamics, that links STC with the cross-correlation [Eq. (14)]. This is a crucial feature in the IInline graphicF dynamics that underlies why the GC connectivity can be captured by the STC on whitened signals. The approximate quadratic relationship between GC and Inline graphic [Fig. 2M-O] ultimately underlies the coincidence between the causal and the structural connectivity for the IInline graphicF networks.

Further investigation of GC

As discussed above, by applying the GC analysis to voltage time series, we have obtained that the synaptic connectivity between neurons can be identified by the GC connectivity for the IInline graphicF networks. We now turn to the further investigation of the following issues: (i) whether the synaptic connectivity between a single neuron and a subnetwork or the connectivity between subnetworks can also be revealed by the GC connectivity; (ii) whether the GC connectivity constructed by merely using the spike train time series is also coincident with the synaptic connectivity; (iii) for more realistic neurons, e.g., the exponential IInline graphicF model, whether there is also a direct connection between synaptic connectivity and GC connectivity; (iv) for networks with both excitatory and inhibitory neurons, whether the network topology can also be successfully reconstructed by the GC analysis.

GC connectivity for subnetworks

In extracellular recording, the microelectrode is usually placed away from individual neurons, allowing the activity of a large number of neurons to contribute to the measured signal. We model the signal extracted from such extracellular microeletrodes, i.e., local field potential, by using the voltage averaged over population of neurons and we will term this as the voltage of subnetworks.

For a nine-neuron network [Figs. S1(A) and S2(A)], we can divide it into one subnetwork and one single neuron, where the single neuron corresponds to one neuron in the original network and the subnetwork corresponds to the remaining eight neurons. Through this division, we can construct an effective two-“neuron” that consists of the subnetwork as an effective neuron and the other neuron as another [Fig. S1(C) and S2(C)]. We compute the GC of this effective two-“neuron” network using the voltage of the subnetwork and the voltage of the single neuron [as displayed in Fig. S1(D) and S2(D)]. Our results show that the GC connectivity can successfully capture the structural connectivity between the subnetwork and the single neuron. This reconstruction holds for the case of a subnetwork presynaptic to a single neuron and vice versa (Figs. S1 and S2).

We further examine whether the synaptic connectivity between subnetworks can be revealed by the GC analysis. For a fifteen-neuron network [Fig. S3(A)], we divide this fifteen-neuron network into three subnetworks and construct an effective three-“neuron” network [Fig. S3(C)]. For this effective network consisting of three subnetworks, there are connections that are both “presynaptic” and “postsynaptic” between some subnetworks and there are also “presynaptic” connections only from one subnetwork to another subnetwork. Using voltage time series of these three subnetworks, we compute the GC connectivity [Fig. S3(D)]. Our results show that the GC connectivity is the same as the structural connectivity between subnetworks. From these results, we can conclude that the synaptic connectivity between subnetworks can also be correctly identified by the corresponding GC connectivity.

GC connectivity via spike trains

We have so far demonstrated that the GC analysis is effective to reconstruct anatomical connectivity within a network by using continuous-valued signals, e.g., voltage time series. Compared with voltage signals, the recent advent of multiple-electrode recording has made it comparatively easy to simultaneously record spiking activity (action potential) of multiple neurons [65][67]. The neuronal activity can often be described by a train of spike events [57], [68], [69],

graphic file with name pone.0087636.e383.jpg (16)

where Inline graphic is the Inline graphicth spike of the Inline graphicth neuron. The spike train can also be characterized as a binary vector with a component chosen as Inline graphic if a spike has occurred in the sample interval, and chosen as Inline graphic otherwise [70]. Such time series present theoretical challenges because most standard signal processing techniques are designed primarily for continuous-time processes instead of point processes [71].

There are some methods which have already been developed to identify causal relationships between spike trains of simultaneously recorded multiple neurons in experiment. For instance, under the assumption of stationarity, a nonparametric frequency domain approach was proposed to estimate GC directly from the Fourier transforms of spike train data [72][74]. Some other statistical methods based on information theory or likelihood function have also been put forth and applied to the analysis of sensory and motor data collected from experiments [75][78]. Here, we focus on the time domain GC analysis and study whether the anatomical connectivity of the IInline graphicF networks can also be directly mapped to the GC connectivity obtained by using spike train data. Note that, this GC analysis is different than using voltage time series. Unlike voltage data which are continuous-valued data, the spike train data are point-process data and it remains to be determined whether these data can be well described by the multivariate autoregressive models [78].

Following the algorithm of the GC analysis, we use spike train time series (binary vector as described above) to construct the causal connectivity network for the IInline graphicF neuronal systems and compare with their structural connectivity. For the two-neuron network as shown in Fig. 1A, we scan the parameters Inline graphic and Inline graphic in Poisson input to cover different dynamical regimes and the range of firing rates of realistic neurons. Our results [Fig. S4(A)] show that the synaptic connectivity between two neurons can be well captured by the causal connectivity. For the hundred-neuron network as shown in Fig. 3A, we compute the causal adjacency matrix Inline graphic and compare it with the synaptic adjacency matrix Inline graphic. Our results [Fig. S4(B)] again demonstrate that Inline graphic can be successfully reconstructed by Inline graphic with very high accuracy (Inline graphic). Similarly, as for the case of GC from voltage time series, there is also a gap when we rank the GC by magnitude for all possible directed connections between neurons. Using a horizontal line [(blue online) in Fig. S4(C)] that divides the GC values into two groups, we can obtain Inline graphic with Inline graphic accuracy by using this horizontal line as the GC threshold Inline graphic.

To demonstrate that our previous analysis of the mechanism underlying the successful reconstruction by using voltage time series for the IInline graphicF networks can also be extended to that using spike train time series, we examine the relation between the regression coefficients Inline graphic, Inline graphic and the residual cross-correlation Inline graphic, Inline graphic as in Eqs. (12) for the two-neuron network in Fig. 1A. Our results [Fig. S5(A) – (C)] show that the relation [Eqs. (12)] between the regression coefficients and the residual cross-correlation holds very well when the GC connectivity is obtained by using spike train time series. Our results show that there is a vanishing coefficient Inline graphic, i.e., no causal influence from neuron Inline graphic to neuron Inline graphic, and a nonvanishing Inline graphic, i.e., there is causal influence from neuron Inline graphic to neuron Inline graphic. This is also consistent with the synaptic connectivity of the two-neuron network as shown in Fig. 1A. Similarly, due to the Inline graphic-like structure of residuals, we can also obtain that the GC constructed from spike train time series is quadratically related to the coupling strength [as verified in Fig. S5(D) – (F)].

GC for exponential integrate-and-fire neuronal networks

To present evidence that our results are not restricted to the standard IInline graphicF model [See Eq. (23) in Methods ], which does not contain spike generation dynamics, we further carry out the GC analysis for the exponential integrate-and-fire (EIInline graphicF) neuronal model [See Eq. (24) in Methods ]. The EIInline graphicF model captures the action potential of real neurons in a biophysically motivated way by fitting the spike-onset region to realistic neurons, such as the conductance-based Wang-Buzsaki model [79][81]. Compared with the standard IInline graphicF model which combines linear filtering of input currents with a strict voltage threshold, the EIInline graphicF model allows a replacement of the strict voltage threshold by a relatively realistic smooth spike initiation zone [82], [83]. The model can quite faithfully reproduce response properties of the Hodgkin-Huxley type neurons under rapidly fluctuating inputs [84], [85].

Using the voltage time series obtained by numerically evolving the system of EIInline graphicF neurons [See Eq. (24) in Methods ], we construct regression models for these simulated data and compute causal connectivity of EIInline graphicF neuronal networks through the GC analysis. We perform the reconstruction [Fig. S6(A)] for the two-neuron network with the synaptic connectivity shown in Fig. 1A by scanning the parameters Inline graphic and Inline graphic. Our results demonstrate that the reconstruction is successful for almost all choices of parameters over different dynamical regimes and with the range over the firing rate (Inline graphicHz) of real neurons [35], [57]. For the reconstruction of the hundred-neuron network with its synaptic connectivity shown in Fig. 3A, the difference between the synaptic adjacency matrix Inline graphic and the constructed causal adjacency matrix Inline graphic is small [Fig. S6(B)]. We can still obtain a very high accurate reconstruction (Inline graphic). Interestingly, if we rank all GC values in order of magnitude for this hundred-neuron network, as for the case of IInline graphicF models, there is also a gap [Fig. S6(C)]. Any horizontal line in the gap [e.g., the blue line in Fig. S6(C)] can be naturally used as a GC threshold Inline graphic to divide the GC values into two groups, yielding the result Inline graphic with Inline graphic accuracy.

In comparison with the IInline graphicF model, the EIInline graphicF neuronal model contains an extra spike-generating current term Inline graphic which takes the form of an exponential function. Note that Inline graphic is almost negligible when the voltage of the neuron is below the spike-initiation threshold Inline graphic. If the neuron fires, Inline graphic will be dominant and the membrane potential will grow exponentially fast to infinity. After that, the voltage of the neuron will be reset to the reset value. Therefore, the EIInline graphicF neuron also possesses the same firing-reset dynamics as the IInline graphicF neuron and our previous analysis, e.g., Eqs. (12) and (15), should also be valid for this more realistic neuronal model. To confirm this, we have verified the relation [Eqs. (12)] between regression coefficients and residual cross-correlations for the two-neuron network in Fig. 1A [as shown in Fig. S7(A) – (C)], and Eqs. (12) is indeed valid for the EIInline graphicF model. Similarly, as for the case of IInline graphicF model, we have a vanishing coefficient Inline graphic, i.e., there is no causal influence from neuron Inline graphic to neuron Inline graphic, and a nonvanishing Inline graphic, i.e., there is a causal influence from neuron Inline graphic to neuron Inline graphic. This is again consistent with the underlying synaptic connectivity between the two neurons as shown in Fig. 1A. By using the Inline graphic-like structure of residuals for the EIInline graphicF networks, we can also obtain that GC is quadratically related to the coupling strength as in Eq. (15). This result has also been numerically verified [Fig. S7(D) – (F)].

GC for excitatory and inhibitory neuronal networks

Finally, we address the issue of whether the above reconstruction can be extended to networks with both excitatory and inhibitory neurons (See Eq. (25) in Methods ). For a two-neuron network with one excitatory and one inhibitory neurons as shown in Fig. 5A, there is only a unidirectional inhibitory synaptic connection from the inhibitory neuron Inline graphic to the excitatory neuron Inline graphic. We scan the parameters of Poisson input and compare the synaptic adjacency matrix Inline graphic and the constructed causal adjacency matrix Inline graphic. As shown in Fig. 5C, Inline graphic is also highly coincident with Inline graphic over a wide range of dynamical regimes. For a three-neuron network with two excitatory neurons and one inhibitory neuron as shown in Fig. 5B, there are both excitatory and inhibitory synaptic connections within this small network. By scanning the parameters of Poisson input as shown in Fig. 5D, we also obtain successful reconstruction of the synaptic connectivity Inline graphic from the causal connectivity Inline graphic over a wide range of dynamical regimes.

Figure 5. GC connectivity for networks with both excitation and inhibition.

Figure 5

Illustrated here are results related to two-neuron and three-neuron IInline graphicF networks with both excitation and inhibition in (A) – (D), and a large network in (E) and (F). The edge with “Inline graphic” or “Inline graphic” at the end signifies the directed excitatory or inhibitory connections, respectively. The input parameters are chosen as Inline graphic (Poisson input rate) and Inline graphic (Poisson input strength). (A) a two-neuron network with one inhibitory neuron (labeled by neuron 1) and one excitatory neuron (labeled by neuron 2). There is only a unidirectional inhibitory synaptic connection from neuron 1 to neuron 2. (B) a three-neuron network with two excitatory neurons (labeled by neuron 1 and 2) and one inhibitory neuron (labeled by neuron 3). There are two excitatory synaptic connections as from neuron 1 to neuron 2 and from neuron 2 to neuron 3. There is also one inhibitory synaptic connection from neuron 3 to neuron 2. (C) The coincidence between Inline graphic and Inline graphic for the two-neuron network in (A). (D) The coincidence between Inline graphic and Inline graphic for the three-neuron network in (B). The white color indicates that Inline graphic, whereas the black color for Inline graphic. (E) The absolute difference between Inline graphic and Inline graphic, i.e., Inline graphic for the large network with 80 excitatory and 20 inhibitory neurons with adjacency matrix shown in Fig. 3A. The white color indicates that Inline graphic, namely, Inline graphic and the black color for Inline graphic. The percentage of total connections (number of nonzero Inline graphic) is Inline graphic and the average neuronal firing rate is Inline graphicHz. By significance test (Inline graphic, See Text S1 for more details), the total number of Inline graphic is Inline graphic out of Inline graphic possible pairs of connections. (F) Ranked GC in order of magnitude with the line (blue online) indicating a threshold obtained from the above significance test. Here, the coupling strength from excitatory to excitatory neuron Inline graphic and from excitatory to inhibitory neuron Inline graphic are Inline graphic (corresponding EPSP is Inline graphicmV), whereas the coupling strength from inhibitory to excitatory neuron Inline graphic and from inhibitory to inhibitory neuron Inline graphic are Inline graphic (the corresponding IPSP is Inline graphicmV).

In addition, we have also considered a hundred-neuron network with 80 excitatory and 20 inhibitory neurons. The synaptic connectivity for this hundred-neuron network is chosen to be the same as that in Fig. 3A. The difference between the synaptic adjacency matrix Inline graphic and the constructed causal adjacency matrix Inline graphic is displayed in Fig. 5E. It can be seen that the accuracy of reconstruction is still very high (Inline graphic). Similarly, we also rank the GC values in order of magnitude and find that, unlike the network with only excitation, there is no clear gap which can naturally divide the GC values into two groups (Fig. 5F). For the GC reconstruction of the network with both excitatory and inhibitory neurons, it is also important to infer the connection type, i.e., excitatory or inhibitory, in addition to the inference of the presence of the connection, and this issue warrants further investigations in the future.

Discussion

We have shown that the linear GC framework with either continuous voltage or discrete spike train time series, can be successfully applied to the reconstruction of IInline graphicF-type neuronal networks. For such nonlinear networks, the causal connectivity obtained by the GC algorithm with sufficiently long time series corresponds well to their synaptic connectivity. In our simulations, we choose the data length of recording activity to be Inline graphicmins [86][88] to ascertain that the statistical error is sufficiently small over a wide range of dynamical regimes. However, in real experiments, there may be many complications to maintain the stationarity of neuronal activity with such a long duration of recording [9]. Therefore, we investigate whether the GC reconstruction can be achieved, with high accuracy, within a realistic range of recording length in experiment. For the two-neuron network as shown in Fig. 1, we have investigated how the minimal data length required for GC reconstruction (See Text S1 for more details) using either voltage or spike train time series depends on neuronal firing rate. As shown in Fig. S8(A) and (C), the minimal data length for a successful GC reconstruction by using voltage time series can be as short as Inline graphicmin for both spontaneous firing rate (less than Inline graphicHz) and the high firing rate range (above Inline graphicHz). In contrast, the minimal data length for GC reconstruction by using spike train time series appears to be monotonically dependent on the neuronal firing rate as shown in Fig. S8(B) and (D). When the firing rate is sufficiently high, e.g., above Inline graphicHz, the required minimal length can be as short as a few seconds. However, if a spontaneous firing rate is sufficiently low, e.g., less than Inline graphicHz, the minimal data length required for the GC reconstruction can be as long as Inline graphicmins. This is somewhat expected because for the GC reconstruction using spike train time series (digital signals), the correlation structure between neurons, as captured by GC influence, can only be reflected by their spikes. If the neuronal firing rate is low, it takes a long time to accumulate a sufficient number of spikes to obtain statistical information of the correlation structure between neurons. However, for the GC reconstruction using voltage time series, the causal influence can be reflected by both subthreshold and suprathreshold (spike) dynamics. Therefore, it may not need that long time to obtain statistical correlation information even if the firing rate is low. Another phenomenon is that the required data length will be shorter if the Poisson input strength becomes smaller. This phenomenon can be clearly seen in Fig. S8 as indicated by the red curve (lower Inline graphic), in general, being lower than the blue curve (higher Inline graphic). This is also intuitively reasonable since the statistical fluctuations may also decrease when the background input becomes weaker while the coupling strength between neurons is fixed.

The computational cost of GC algorithm can be estimated to be Inline graphic, where Inline graphic is the data length, Inline graphic is the total neuron number and Inline graphic is the regression order in the regression models (See Methods for more details). The first term describes the computational cost of covariance matrices and the second term corresponds to the computational cost arising from solving Yule-Walker equations (There are some more efficient algorithms, such as Levinson, Euclidean and Berlekamp-Massey algorithms, which can solve the Yule-Walker equations with Inline graphic arithmetic operations). Furthermore, we have established a quantitative relationship among the GC, the STC and the coupling strength. Our theoretical analysis based on voltage time series can be naturally extended to the case of spike trains time series and our results show that the GC tool can be directly applied to point-process data [74], [78]. Therefore, the linear GC technique can be potentially used to detect the underlying synaptic connections within a neuronal network by measuring either the voltage trajectories or the spike trains of neurons. We note in passing that the GC reconstruction does not perform well in some cases as shown by the white color region in Fig. 1E–F and Fig. 5C–D. It appears that the statistical error is still not sufficiently small in these cases. We have also examined the dependence of performance of GC reconstruction on the density of the connection matrix. For the case of low density connections (less than Inline graphic) as shown in Figs. 3,5, and 6, the GC reconstruction has a very high accuracy. This indicates the GC reconstruction could potentially be applied to the cortical network reconstruction since many studies have indicated that the structural brain connectivity forms a sparse graph [22], [89]. It appears that for a network of high density connections, e.g., greater than Inline graphic, the GC reconstruction does not perform as well, e.g., with approximately Inline graphic accuracy of reconstruction. We suspect that this could be related to the fact that the signal-to-noise ratio for each pair of coupling to be out of the dense coupling pool is much lower for a network with dense connections than that with sparse connections. A further systematic investigation is warranted to achieve a full understanding of this issue in the future.

Figure 6. GC reconstruction for a large network with low density connections.

Figure 6

Illustrated here are results for a large IInline graphicF network (Inline graphic excitatory and Inline graphic inhibitory neurons) with random connectivity. The indices from Inline graphic to Inline graphic are for excitatory neurons and the indices from Inline graphic to Inline graphic are for inhibitory neurons. The total number of nonzero Inline graphic is Inline graphic (the percentage of connections is Inline graphic) and the average neuronal firing rate is Inline graphicHz. (A) The synaptic adjacency matrix Inline graphic with the white color indicating that Inline graphic and the black color for Inline graphic. (B) The absolute difference between Inline graphic and the causal adjacency matrix Inline graphic, i.e., Inline graphic. The white color indicates that Inline graphic, namely, Inline graphic and the black color for Inline graphic. By significance test (Inline graphic, See Text S1 for more details), the total number of Inline graphic is Inline graphic out of Inline graphic possible pairs of connections. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), the coupling strength from excitatory to excitatory neuron Inline graphic and from excitatory to inhibitory neuron Inline graphic are Inline graphic (the corresponding EPSP is Inline graphicmV), whereas the coupling strength from inhibitory to excitatory neuron Inline graphic and from inhibitory to inhibitory neuron Inline graphic are Inline graphic (corresponding to IPSP Inline graphicmV).

In addition, we have shown that the synaptic connection in some coarse-grained sense, e.g., the connection between an individual neuron and a subnetwork, or the connection between subnetworks, can also be recovered through GC analysis. In our work, the recorded time series of a subnetwork is the voltage response averaged over neurons within the subnetwork, which can be viewed as a model for the local field potential (LFP). Note that the LFP in our case includes both the subthreshold dynamics and the spike-reset dynamics, and it may be different from the LFP normally measured in experiment, which contains only a low-pass filtered component of population voltages [90]. As for the averaged voltage response processed by a low-pass filter, our conclusions can still be valid as long as the low-pass filter is chosen to be a causal filter, namely, the filter output depends only on past and present inputs. The reason can be explained as follows: if the averaged voltage response (AVR) is processed by a causal low-pass filter, then the transformation between the filtered AVR and the original AVR is linear and invertible. The GC is invariant under such filtering because of the invariance of GC under invertible linear transformation [44], [45]. In fact, the filtered AVR is different from the original AVR. However, the residual of auto regression for the filtered AVR is only different from that for the original AVR by a factor if the filter is chosen to be a causal filter. Therefore, the corresponding structure of both the residual cross-correlation and the STC on residuals are the same as those of the original AVR (although the amplitude may be different by a factor). As a result, our conclusions about network reconstruction and our theoretical analysis remain valid.

There are other important issues that remain to be fully elucidated in the future. One of them is whether an accurate reconstruction can still be obtained when the inputs to neurons are correlated. For instance, it is quite common that a pair of neurons may receive a common synaptic input from another neuron [91][93]. Our study shows that an approximate reconstruction can be achieved (with an accuracy greater than Inline graphic) if the correlation coefficient for two input spike trains is less than Inline graphic [94]. As an illustration of how the success of GC reconstruction depends on the input correlation, we have studied the effects of input correlation on the GC reconstruction by using either voltage or spike train time series for the two-neuron network as shown in Fig. 1A. In addition to its own Poisson input (independent of each other) with the same rate Inline graphic and the same strength Inline graphic, each neuron in the network receives a common Poisson input with rate Inline graphic and strength Inline graphic. The percentage of common Poisson input Inline graphic is defined by Inline graphic. As discussed previously, a successful GC reconstruction for the synaptic connectivity of this network indicates that the GC from neuron Inline graphic to neuron Inline graphic (Inline graphic or Inline graphic) is significantly nonzero, whereas the GC from neuron Inline graphic to neuron Inline graphic (Inline graphic or Inline graphic) nearly vanishes. Therefore, the GC ratios Inline graphic and Inline graphic can be used as a measure of quantifying how successful GC reconstructions are. As shown in Fig. S9, we plot such GC ratios as a function of Inline graphic. It can be seen from Fig. S9 that the magnitude of both GC ratios drops rapidly as Inline graphic increases, thus indicating that the GC reconstruction eventually fails when Inline graphic is large. However, as shown in Fig. S9, the GC reconstruction can still be trusted if the percentage of common Poisson input is less than Inline graphic because there is about one order of magnitude difference between Inline graphic (Inline graphic) and Inline graphic (Inline graphic).

Another issue is related to the synchronization among neurons [95]. We have found that, for a nearly (not fully spike-to-spike) synchronized regime, the reconstruction can be achieved by refining sampling. It is obvious that the drive-response scenario, which the GC theory addresses, would be difficult to disentangle when the neuronal network falls into the spike-to-spike synchronized dynamical regime [95][98]. In such cases, the causal influences between neurons would decrease, whereas the instantaneous causality would increase [14]. As for the sampling rate used in our simulations, we choose Inline graphickHz for our sampling rate (the time scale of refractory period in our neuronal models is Inline graphicms, therefore, the sampling rate should be chosen larger than Inline graphicHz to capture this time scale). In addition, we have also examined different sampling rates between Inline graphickHz and Inline graphickHz and found that the structural connectivity can always be revealed by GC connectivity with similar high accuracy.

Finally, we point out that there are some other methods that have been developed to reconstruct the network topology, e.g., phase resetting or chaotic synchronization [99][107]. These techniques were applied to either coupled oscillators or current-based networks [108], which can be regarded as the reduced form of the general conductance-based IInline graphicF networks. For instance, in the limit Inline graphic, Inline graphic and Inline graphic, the conductance-based IInline graphicF network reduces to Mirollo-Strogatz oscillators which are widely used in the study of synchronization phenomena [109]. Therefore, our work provides a general methodology to reconstruct the network topology for conductance-based IInline graphicF networks. In terms of the GC theory, there are also some extensions to investigate causal relationship for nonlinear and non-Gaussian time series, e.g., the kernel-Granger causality method [110], [111]. The concept of such nonlinear GC is formulated by using the theory of reproducing kernel Hilbert spaces that are spanned by choosing proper kernel functions. The form of kernel functions relies on the nonlinearity of the original dynamical systems, which is usually unknown. In our work, if we choose the kernel function for IInline graphicF networks to be a bilinear function, then the nonlinear GC framework reduces to the linear GC framework. Our results have shown that such reduced nonlinear GC analysis is able to capture well the underlying topology of IInline graphicF networks.

Methods

Granger Causality (GC) Analysis

We first recall theoretical definitions of GC for time series in the bivariate case and the conditional GC for time series in the multivariate case (In the discussion of GC, we will always assume that the mean of time series has been subtracted and the expectations of time series for both bivariate and multivariate cases are zero). The idea of GC was formalized in the context of linear regression models [43], [112]. Specifically, if the variance of the prediction error of the first time series in the auto regressive model is reduced by incorporating the knowledge of the second one, then the second time series is said to have a causal influence on the first one [44], [45]. The roles of the two time series can be reversed to address the question of causal influence in the opposite direction. The GC theory has been widely applied to many research fields as mentioned in Introduction [14], [46].

Bivariate case

For two time series Inline graphic and Inline graphic, their auto regression (AR) models can be represented by

graphic file with name pone.0087636.e584.jpg (17)

where Inline graphic and Inline graphic are residuals (prediction errors) of AR processes for Inline graphic and Inline graphic, respectively. To illustrate GC relations between Inline graphic and Inline graphic, we further consider their joint regression (JR) models as

graphic file with name pone.0087636.e591.jpg (18)

where Inline graphic is the residual of JR process for Inline graphic by further incorporating the history of Inline graphic, and Inline graphic is the residual of JR process for Inline graphic by further incorporating the history of Inline graphic [14], [113]. By assuming that Inline graphic and Inline graphic are wide-sense stationary, i.e., their means and variances are constants, the GC from Inline graphic to Inline graphic, denoted by Inline graphic, and that from Inline graphic to Inline graphic, denoted by Inline graphic are defined as

graphic file with name pone.0087636.e606.jpg (19)

where Inline graphic and Inline graphic are the variances of the residuals Inline graphic and Inline graphic in AR models, respectively. These variances quantify the accuracy of the autoregressive prediction of Inline graphic and Inline graphic at the present moment based on their own past. The quantities Inline graphic and Inline graphic are the variances of the residuals Inline graphic and Inline graphic in JR models, respectively. They represent the accuracy of predicting the present value of Inline graphic or Inline graphic based on the previous values of both Inline graphic and Inline graphic [44], [45]. For instance, if Inline graphic is less than Inline graphic, then there is an improvement in the prediction of Inline graphic by incorporating the history of Inline graphic, thus Inline graphic is said to have a causal influence on Inline graphic. Note that, both Inline graphic and Inline graphic cannot be negative by definition. In particular, Inline graphic [Inline graphic] corresponds to the situation where there is no causal influence from Inline graphic [Inline graphic] to Inline graphic [Inline graphic] [14], [44].

Multivariate case

In the case of multivariate time series Inline graphic (Inline graphic), the causal relation between two time series, say, Inline graphic and Inline graphic, can be directly mediated or it can be indirectly mediated by a third one, say Inline graphic. However, the above pairwise analysis for the bivariate case cannot distinguish whether the causal influence between Inline graphic and Inline graphic is direct or indirect [14]. The framework of conditional Granger causality was developed to address such situations [45]. The procedure can be carried out as follows: for any two time series Inline graphic and Inline graphic among the set Inline graphic, the conditional AR processes are represented by

graphic file with name pone.0087636.e645.jpg (20)

where “conditional” means the auto regressions of Inline graphic and Inline graphic are performed when the history of all other time series Inline graphic (Inline graphic) is given. Furthermore, we consider the conditional JR processes for Inline graphic and Inline graphic as

graphic file with name pone.0087636.e652.jpg (21)

From Eqs. (20) and (21), the conditional GC from Inline graphic to Inline graphic, denoted by Inline graphic, and that from Inline graphic to Inline graphic, denoted by Inline graphic, are defined as

graphic file with name pone.0087636.e659.jpg (22)

Note that, in Eqs. (20) and (21), both the auto and joint regressions of Inline graphic and Inline graphic are performed by including the history of other time series Inline graphic (Inline graphic). Therefore, if the causal influence between Inline graphic and Inline graphic is entirely mediated by some other time series in the set Inline graphic, the variance of residuals in conditional AR models will be equal to the variance of residuals in conditional JR models, i.e., Inline graphic and Inline graphic. Therefore, we have Inline graphic and Inline graphic, that is, no further improvement in the prediction of Inline graphic Inline graphic in JR models can be expected by including past measurements of Inline graphic Inline graphic. On the other hand, if the causal relation between Inline graphic and Inline graphic, say from Inline graphic to Inline graphic, is direct, the inclusion of past measurements of Inline graphic in addition to that of Inline graphic and Inline graphic will result in a better prediction of Inline graphic, thus leading to Inline graphic and Inline graphic.

GC algorithm for IInline graphicF networks

Here, for an IInline graphicF network with Inline graphic neurons, we propose the following numerical algorithm of computing GC through the voltage time series of neurons (similarly for the case of using spike train time series). We denote the voltage trajectory of the Inline graphicth neuron by Inline graphic, and the GC from the Inline graphicth neuron to the Inline graphicth neuron, obtained from these voltage time series, by Inline graphic. According to the above definition of GC, we compute both regression residuals Inline graphic and Inline graphic as in Eqs. (20) and (21) to obtain Inline graphic in Eq. (22). Note that the GC from the Inline graphicth neuron to itself is always zero by definition (For neuronal systems discussed in our work, we do not consider autapses in the network). The flow of the algorithm to compute each Inline graphic for every pair of neurons, where Inline graphic and Inline graphic, can be described as follows (See Text S1 for more details):

Step 1: Evolve the IInline graphicF network dynamics [e.g., Eq. (23) in Methods ] numerically and record the voltage signal averaged over each small time window (Inline graphicms, i.e., sampling rate is Inline graphickHz) to form voltage time series of Inline graphic neurons as Inline graphic, Inline graphic. In most of our simulations, Inline graphic is chosen to be Inline graphic, which corresponds to the length of time series Inline graphicmins. Then, construct an Inline graphic dimensional vector Inline graphic Inline graphic, Inline graphic, Inline graphic, Inline graphic and Inline graphic dimensional vectors Inline graphic Inline graphic, Inline graphic, Inline graphic, Inline graphic Inline graphic, Inline graphic, Inline graphic for Inline graphic, where Inline graphic has zero mean and the superscript Inline graphic in Inline graphic denotes the fact that the Inline graphicth component Inline graphic in Inline graphic is removed.

Step 2: For any given regression order Inline graphic, compute the covariance matrix functions Inline graphic Inline graphic for Inline graphic, Inline graphic, Inline graphic to construct the Yule-Walker equations. We denote the coefficient matrix and the right hand side of the Yule-Walker equations by Inline graphic and Inline graphic, respectively [Eqs. (4) – (7) in Text S1]. Solve the Yule-Walker equations to obtain the regression coefficients, which are denoted by Inline graphic [Eq. (6) in Text S1]. Then, substitute Inline graphic into the regressive equations [Eq. (1) in Text S1] to obtain the residual vector Inline graphic, Inline graphic, Inline graphic, Inline graphic and calculate its covariance matrix, which is denoted by Inline graphic [Eq. (2) in Text S1].

Step 3: Now, for each Inline graphic, we have Inline graphic, therefore, we can obtain the BIC function [Eq. (10) in Text S1] as a function of Inline graphic. Use the BIC criterion to find the correct regression order Inline graphic which corresponds to the situation where the BIC function reaches its minimum.

Step 4: Then, choose Inline graphic and return to Step 2 to obtain the residual vector Inline graphic and also the covariance matrix Inline graphic. The Inline graphicth diagonal element of Inline graphic, denoted by Inline graphic, corresponds to Inline graphic, which is the variance of the residual Inline graphic in the joint regression model of the Inline graphicth neuron by incorporating the information of the Inline graphicth neuron (Inline graphic) in addition to all other Inline graphicth neurons (Inline graphic and Inline graphic). Set Inline graphic Inline graphic, for different Inline graphic.

Step 5: Let Inline graphic and use Inline graphic for each Inline graphic (Inline graphic) to follow the procedure of Step 2 to obtain the residual vector Inline graphic and the covariance matrix Inline graphic. If the neuron index Inline graphic, the Inline graphicth diagonal element Inline graphic corresponds to Inline graphic, which is the variance of the residual Inline graphic in the AR model of the Inline graphicth neuron by incorporating the information of all other neurons except the Inline graphicth neuron, set Inline graphic Inline graphic. Otherwise, for Inline graphic, the Inline graphicth diagonal element Inline graphic corresponds to Inline graphic and set Inline graphic Inline graphic.

Step 6: Compute all the GC values Inline graphic Inline graphic for all pairs of neurons, i.e., Inline graphic.

Integrate-and-fire (IInline graphicF) neuronal network

We consider an IInline graphicF network with Inline graphic conductance-based, pulse-coupled, excitatory point neurons. Under a Poisson drive, its dynamics is governed by

graphic file with name pone.0087636.e794.jpg (23)

where the index Inline graphic labels the Inline graphicth neuron in the network. Inline graphic is the membrane potential and Inline graphic is the excitatory synaptic conductance. Inline graphic is the excitatory reversal potential. Inline graphic and Inline graphic are the leaky conductance and the leaky reversal potential, respectively. The excitatory synaptic dynamics are described by Inline graphic, which rises instantaneously upon receiving a spike and has a decay time scale Inline graphic. The voltage of the Inline graphicth neuron Inline graphic evolves continuously according to Eq. (23) until it reaches the firing threshold Inline graphic, at which point the Inline graphicth neuron is referred to as producing an action potential or emitting a spike (the time of the Inline graphicth spike is recorded as Inline graphic). Then, this spike triggers postsynaptic events in all the neurons that the Inline graphicth neuron is presynaptically connected to and changes their conductances with the coupling strength Inline graphic [the corresponding physiological excitatory postsynaptic potential (EPSP) is Inline graphicmV]. Here, the synaptic connectivity of the network is characterized by an adjacency matrix Inline graphic, where Inline graphic (Inline graphic) means the presynaptic Inline graphicth neuron is connected (unconnected) to the postsynaptic Inline graphicth neuron. Meanwhile, Inline graphic after the Inline graphicth neuron's spike is reset to the reset voltage Inline graphic and is held at Inline graphic for an absolute refractory period of Inline graphic ms. Each neuron (say, the Inline graphicth neuron) in the system is also driven by a stochastic feedforward input Inline graphic, a spike train sampled from a Poisson process with rate Inline graphic. We denote Inline graphic as the Inline graphicth spike from the feedforward input to the Inline graphicth neuron and the delta function associated with this spike instantaneously increases the Inline graphicth neuron's conductance by magnitude Inline graphic.

In comparison with the classical Hodgkin-Huxley (HH) neuronal model with detailed ionic currents to resolve the stereotypical spike dynamics [114], the model (23), as a reduced neuronal model, is much more efficient in terms of computation while capturing sufficiently rich network dynamics of HH models [58], [59], [96], [115], [116]. Therefore, it has been widely used in large-scale simulations to address information processing issues arising from neuronal systems [36][42]. In the reduced-dimensional units, in which only time retains dimensional, with units of conductance being [Inline graphic], the parameters in the model (23) are chosen as [117]: Inline graphic, Inline graphic Inline graphic, Inline graphic, Inline graphic, Inline graphic, Inline graphic, which correspond to typical physiological values: Inline graphic, Inline graphic, Inline graphic, Inline graphic.

Exponential integrate-and-fire (EIInline graphicF) neuronal network

The dynamics of an excitatory EIInline graphicF neuronal network with Inline graphic neurons is governed by

graphic file with name pone.0087636.e846.jpg (24)

where the function Inline graphic characterizes the spike-generating current of the Inline graphicth neuron [80]. Here, Inline graphic is the slope factor and Inline graphic is the spike-initiation threshold potential. Each neuron (say, the Inline graphicth neuron) in the system is driven by an external stochastic feedforward input as Inline graphic. If the input current exceeds some threshold Inline graphic, the membrane potential of the Inline graphicth neuron Inline graphic will diverge to infinity in finite time since Inline graphic is supralinear. This divergence is identified as the emission of a spike of the Inline graphicth neuron. And at the same time Inline graphic is reset to the reset voltage Inline graphic and is held at Inline graphic for an absolute refractory period of Inline graphic ms. Note that, with Inline graphic, the EIInline graphicF model reduces to the standard IInline graphicF model under the limit Inline graphic goes to zero. Some parameters are chosen to be the same as those in IInline graphicF models and others in the reduced-dimensional units in the model (24) are chosen as [80], [84]: Inline graphic, Inline graphic, Inline graphic, Inline graphic.

IInline graphicF networks with both excitation and inhibition

For a conductance-based IInline graphicF network with Inline graphic excitatory neurons and Inline graphic inhibitory neurons, its dynamics under Poisson drives is governed by

graphic file with name pone.0087636.e875.jpg (25)

where the Inline graphicth neuron with type Inline graphic, has both excitatory conductance Inline graphic and inhibitory conductance Inline graphic, and the Inline graphic and Inline graphic are the excitatory and inhibitory reversal potentials, respectively. If an excitatory neuron (say, the Inline graphicth neuron) fires and is presynaptic to the Inline graphicth neuron (i.e., Inline graphic = 1), the Inline graphicth neuron's excitatory conductance Inline graphic will be increased by the coupling strength Inline graphic. If an inhibitory neuron (say, the Inline graphicth neuron) fires and is presynaptic to the Inline graphicth neuron (i.e., Inline graphic = 1), the Inline graphicth neuron's inhibitory conductance Inline graphic will be increased by the coupling strength Inline graphic. [the corresponding physiological inhibitory postsynaptic potential (IPSP) is Inline graphicmV]. The Inline graphic and Inline graphic are external Poisson drives for the Inline graphicth neuron arising from background excitation and inhibition, respectively. For simplicity, we only consider the excitatory background input, i.e., Inline graphic, and choose the input rate Inline graphic and input strength Inline graphic. In the reduced-dimensional units, the parameters of inhibition in the model (25) are chosen as [117] Inline graphic, Inline graphic, which correspond to typical physiological values, Inline graphic. Other parameters are chosen to be the same as those in excitatory IInline graphicF models [Eq. (23)].

Supporting Information

Figure S1

GC from a subnetwork to a single neuron. For this nine-neuron network, we can divide it into one subnetwork and one single neuron, where the single neuron corresponds to neuron Inline graphic and the subnetwork corresponds to the remaining eight neurons. Here, the subnetwork is presynaptic to the single neuron. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (the corresponding EPSP is Inline graphicmV). (A) A nine-neuron network with its synaptic connectivity. (B) The constructed causal adjacency matrix Inline graphic which captures the synaptic connectivity in (A). The white color in Inline graphic means there is no causal connection from neuron Inline graphic to neuron Inline graphic, i.e., Inline graphic, and the black color represents the existence of a causal connection from neuron Inline graphic to neuron Inline graphic, i.e., Inline graphic. (C) An effective two-neuron network constructed from (A), where the “neuron Inline graphic” represents the subnetwork that consists of all neurons in (A) except for neuron Inline graphic as indicated by gray boxes (red online) in (B). The neuron Inline graphic represents neuron Inline graphic in (A). The voltage of “neuron Inline graphic” is the mean voltage averaged over all neurons in the subnetwork. (D) The computed causal adjacency matrix for (C), which successfully captures the unidirectional connection from the subnetwork “neuron Inline graphic” to the single neuron labeled by Inline graphic [neuron Inline graphic in (A)].

(EPS)

Figure S2

GC from a single neuron to a subnetwork. For this nine-neuron network, we can divide it into one subnetwork and one single neuron, where the single neuron corresponds to neuron Inline graphic and the subnetwork corresponds to the remaining eight neurons. Here, the subnetwork is postsynaptic to the single neuron. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV). (A) A nine-neuron network with its synaptic connectivity. (B) The constructed causal adjacency matrix Inline graphic which captures the synaptic connectivity in (A). The white color in Inline graphic means there is no causal connection from neuron Inline graphic to neuron Inline graphic, i.e., Inline graphic, and the black color represents the existence of causal connection from neuron Inline graphic to neuron Inline graphic, i.e., Inline graphic. (C) An effective two-neuron network constructed from (A), where neuron Inline graphic represents neuron Inline graphic in (A), “neuron Inline graphic” represents the entire network (A) except for neuron Inline graphic. The voltage of “neuron Inline graphic” is the voltage averaged over all neurons in the subnetwork, as indicated by gray boxes (red online). (D) The computed causal adjacency matrix for (C), which captures the unidirectional causal influence from the single neuron, labeled by Inline graphic [neuron Inline graphic in (A)], to the subnetwork “neuron Inline graphic”.

(EPS)

Figure S3

GC between subnetworks. To construct subnetworks, we divide this fifteen-neuron network into three subnetworks and construct an effective three-“neuron” network. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV). (A) The synaptic adjacency matrix Inline graphic for a fifteen-neuron network. The white color in Inline graphic indicates that there is no synaptic connection from neuron Inline graphic to neuron Inline graphic, i.e., Inline graphic and the black color represents that the neuron Inline graphic is presynaptic to the neuron Inline graphic, i.e., Inline graphic. (B) The causal adjacency matrix Inline graphic constructed by GC, which is identical to Inline graphic. (C) An effective three-neuron network constructed from (A), where the voltage of neuron “Inline graphic”,“Inline graphic” and “Inline graphic” are the averaged response over each group of neurons, respectively. “Neuron Inline graphic” [indicated by the red box in (A)] represents a subnetwork from neuron Inline graphic to neuron Inline graphic, “neuron Inline graphic” [indicated by the blue box in (A)] represents a subnetwork from neuron Inline graphic to neuron Inline graphic, and “neuron Inline graphic” [indicated by the green box in (A)] represents a subnetwork from neuron Inline graphic to neuron Inline graphic. (D) The computed causal adjacency matrix for (C), which captures the effective synaptic connections between the subnetworks.

(EPS)

Figure S4

GC connectivity using spike train. Network reconstruction by GC using the spike train time series of the IInline graphicF model. (A) The coincidence between the synaptic adjacency matrix Inline graphic and the causal adjacency matrix Inline graphic for the two-neuron network in Fig. 1A. The white color indicates that Inline graphic, and the black color for Inline graphic. (B) The absolute difference between Inline graphic and Inline graphic, i.e., Inline graphic, for the hundred-neuron network in Fig. 3A. The white color indicates that Inline graphic, namely, Inline graphic and the black color for Inline graphic. The total number of Inline graphic is Inline graphic out of Inline graphic possible pairs of connections (with Inline graphic in the significance test). (C) Ranked GC in order of magnitude for the hundred-neuron network in Fig. 3A. The gray line (blue online) indicates a threshold in the gap of the ranked GC. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV).

(EPS)

Figure S5

GC analysis using spike train. Illustrated here is the validity of the relations used in the mechanism analysis computed by using the spike trains of the two excitatory neurons of the IInline graphicF network in Fig. 1A with different Poisson input rate Inline graphic for the highly fluctuating regime [(A) and (D)] with Inline graphic, intermediate regime [(B) and (E)] with Inline graphic and mean-driven regime [(C) and (F)] with Inline graphic. The fixed input strength Inline graphic. (A), (B), and (C) are regression coefficients Inline graphic (blue “plus” online), Inline graphic (red “cross” online) and their approximations Inline graphic (“square” symbol), Inline graphic (“circle” symbol) for three different dynamical regimes. (D), (E), and (F) are the GC Inline graphic (red “star” online) as a function of coupling strength Inline graphic for three different dynamical regimes. The line (black online) is a quadratic fit.

(EPS)

Figure S6

GC connectivity for EI Inline graphic F networks. Network reconstruction by GC using the voltage time series of the EIInline graphicF model. (A) The coincidence between the synaptic adjacency matrix Inline graphic and the causal adjacency matrix Inline graphic for the two-neuron network in Fig. 1A. The white color indicates that Inline graphic, and the black color for Inline graphic. (B) The absolute difference between Inline graphic and Inline graphic, i.e., Inline graphic, for the hundred-neuron network in Fig. 3A. The white color indicates that Inline graphic, namely, Inline graphic and the black color for Inline graphic. The total number of Inline graphic is Inline graphic out of Inline graphic possible pairs of connections (with Inline graphic in the significance test). The average neuronal firing rate is Inline graphicHz. (C) Ranked GC in order of magnitude for the hundred-neuron network in Fig. 3A. The gray line (blue online) indicates a threshold in the gap of the ranked GC. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV).

(EPS)

Figure S7

GC analysis for EI Inline graphic F networks. Illustrated here is the validity of the relations in the mechanism analysis of GC computed by using the voltage time series of the two excitatory neurons of the EIInline graphicF network in Fig. 1A with different Poisson input rate Inline graphic for the highly fluctuating regime [(A) and (D)] with Inline graphic, intermediate regime [(B) and (E)] with Inline graphic and low fluctuating regime [(C) and (F)] with Inline graphic. The fixed input strength Inline graphic. (A), (B), and (C) are regression coefficients Inline graphic (blue “plus” online), Inline graphic (red “cross” online) and their approximations Inline graphic (“square” symbol), Inline graphic (“circle” symbol) for three different dynamical regimes. (D), (E), and (F) are the GC Inline graphic (red “star” online) for three different dynamical regimes. The line (black online) is a quadratic fit.

(EPS)

Figure S8

Minimal data length vs. neuronal firing rate. Illustrated here is the minimum data length required for GC reconstruction of the IInline graphicF network in Fig. 1A as a function of neuronal firing rate. (A) GC reconstruction using voltage time series with firing rate between Inline graphicHz and Inline graphicHz. (B) the same as (A) but using spike train time series. (C) the same as (A) but with firing rate between Inline graphicHz and Inline graphicHz. (D) the same as (B) but with firing rate between Inline graphicHz and Inline graphicHz. The Poisson input strength Inline graphic is chosen as Inline graphic [red “star”, the line is for guiding the eye only.], Inline graphic [blue “circle”, the line is for guiding the eye only.] and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV). The Poisson input rate Inline graphic is chosen to satisfy the corresponding neuronal firing rate.

(EPS)

Figure S9

GC ratio vs. the percentage of common Poisson input. Illustrated here are the GC ratios Inline graphic and Inline graphic for the IInline graphicF network in Fig. 1A. Neuron Inline graphic and neuron Inline graphic are driven by two independent background Poisson inputs with same rate Inline graphic and same strength Inline graphic. In addition, both neurons are also driven by another common Poisson input (independent of their background Poisson input) with rate Inline graphic and strength Inline graphic. The percentage of common Poisson input Inline graphic is defined by Inline graphic. (A) The ratio of computed GC by using voltage time series: Inline graphic as a function of Inline graphic. (B) The ratio of computed GC by using spike train time series: Inline graphic as a function of Inline graphic. In (A) and (B), the red “star” symbol linked by solid line corresponds to the highly fluctuating regime with Inline graphic as shown in Fig. 2A, the blue “circle” symbol linked by solid line corresponds to the intermediate regime with Inline graphic as shown in Fig. 2B and the black “square” symbol linked by solid line corresponds to the mean-driven regime with Inline graphic as shown in Fig. 2C. Parameters in (A) and (B) are chosen as Inline graphic [red “star”, the line is for guiding the eye only.], Inline graphic [blue “circle”, the line is for guiding the eye only.], Inline graphic [black “square”, the line is for guiding the eye only.] and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV).

(EPS)

Text S1

Computational issues of GC.

(PDF)

Funding Statement

D.Z. is supported by Shanghai Pujiang Program (Grant No. 10PJ1406300), National Science Foundation in China (Grant No. 11101275 and No. 91230202), and the Scientific Research Foundation for the Returned Overseas Chinese Scholars from State Education Ministry in China. D.C. is supported by NSF-DMS-1009575. All authors are also supported by a research grant G1301 from NYU Abu Dhabi Research Institute. Y.X., Y.Z., and Z.X. were partially supported by an Undergraduate Research Program in Zhiyuan College at Shanghai Jiao Tong University. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

References

  • 1. Newman MEJ (2003) The structure and function of complex networks. SIAM Review 45: 167–256. [Google Scholar]
  • 2. Sporns O, Chialvo DR, Kaiser M, Hilgetag C (2004) Organization, development and function of complex brain networks. TRENDS in Cognitive Sciences 8: 418–425. [DOI] [PubMed] [Google Scholar]
  • 3. Honey CJ, Thivierge J, Sporns O (2010) Can structure predict function in the human brain? NeuroImage 52: 766–776. [DOI] [PubMed] [Google Scholar]
  • 4. Strogatz SH (2001) Exploring complex networks. Nature 410: 268–276. [DOI] [PubMed] [Google Scholar]
  • 5. Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU (2006) Complex networks: structure and dynamics. Physics Reports 424: 175–308. [Google Scholar]
  • 6. Bullmore E, Sporns O (2009) Complex brain networks: graph theoretical analysis of structural and functional systems. Nature Reviews Neuroscience 10: 186–198. [DOI] [PubMed] [Google Scholar]
  • 7. Jin X, Prince DA, Huguenard JR (2006) Enhanced excitatory synaptic connectivity in layer v pyramidal neurons of chronically injured epileptogenic neocortex in rats. The Journal of Neuroscience 26: 4891–4900. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 8. Avramescu S, Timofeev I (2008) Synaptic strength modulation after cortical trauma: a role in epileptogenesis. The Journal of Neuroscience 28: 6760–6772. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 9. Stetter O, Battaglia D, Soriano J, Geisel T (2012) Model-free reconstruction of excitatory neuronal connectivity from calcium imaging signals. PLoS Computational Biology 8: e1002653. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 10. McIntosh AR, Gonzalez-Lima F (1994) Structural equation modeling and its application to network analysis in functional brain imaging. Human Brain Mapping 2: 2–22. [Google Scholar]
  • 11. Buchel C, Friston KJ (1997) Modulation of connectivity in visual pathways by attention: cortical interactions evaluated with structural equation modelling and fmri. Cerebral Cortex 7: 768–778. [DOI] [PubMed] [Google Scholar]
  • 12. Schreiber T (2000) Measuring information transfer. Physical Review Letters 85: 461–464. [DOI] [PubMed] [Google Scholar]
  • 13. Gourevitch B, Eggermont J (2007) Evaluating information transfer between auditory cortical neurons. Journal of Neurophysiology 97: 2533–2543. [DOI] [PubMed] [Google Scholar]
  • 14.Ding M, Chen Y, Bressler SL (2006) Granger causality: basic theory and application to neuroscience. In Handbook of time series analysis, Schelter S, Winterhalder M, Timmer J, (eds) Wiley-VCH: Berlin: 437–460.
  • 15. Guo S, Wu J, Ding M, Feng J (2008) Uncovering interactions in the frequency domain. PLoS Computational Biology 4: e1000087. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 16. Ge T, Kendrick KM, Feng J (2009) A novel extended granger causal model approach demonstrates brain hemispheric differences during face recognition learning. PLoS Computational Biology 5: e1000570. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 17. Lee L, Friston K, Horwitz B (2006) Large-scale neural models and dynamic causal modelling. NeuroImage 30: 1243–1254. [DOI] [PubMed] [Google Scholar]
  • 18.Neapolitan RE (2009) Probabilistic methods for bioinformatics: with an introduction to Bayesian networks. Morgan Kaufmann Publishers.
  • 19. Friston K (1994) Functional and effective connectivity in neuroimaging: a synthesis. Human Brain Mapping 2: 56–78. [Google Scholar]
  • 20. Horwitz B (2003) The elusive concept of brain connectivity. NeuroImage 19: 466–470. [DOI] [PubMed] [Google Scholar]
  • 21. Rubinov M, Sporns O (2010) Complex network measures of brain connectivity: uses and interpretations. NeuroImage 52: 1059–1069. [DOI] [PubMed] [Google Scholar]
  • 22. Honey CJ, Kotter R, Breakspear M, Sporns O (2007) Network structure of cerebral cortex shapes functional connectivity on multiple time scales. Proceedings of National Academy of Sciences of the United States of America 104: 10240–10245. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 23. Honey CJ, Sporns O, Cammoun L, Gigandet X, Thiran JP, et al. (2009) Predicting human restingstate functional connectivity from structural connectivity. Proceedings of National Academy of Sciences of the United States of America 106: 2035–2040. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 24. Zhou D, Xiao Y, Zhang Y, Xu Z, Cai D (2013) Causal and structural connectivity of pulse-coupled nonlinear networks. Physical Review Letters 111: 054102. [DOI] [PubMed] [Google Scholar]
  • 25. Gerhard F, Kispersky T, Gutierrez GJ, Marder E, Kramer M, et al. (2013) Successful reconstruction of a physiological circuit with known connectivity from spiking activity alone. PLoS Computational Biology 9: e1003138. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 26. Hagmann P, Cammoun L, Gigandet X, Meuli R, Honey CJ, et al. (2008) Mapping the structural core of human cerebral cortex. PLoS Biology 6: 1479–1493. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 27. Greicius MD, Supekar K, Menon V, Dougherty RF (2009) Resting-state functional connectivity reflects structural connectivity in the default mode network. Cerebral Cortex 19: 72–78. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 28. Wang XJ (2010) Neurophysiological and computational principles of cortical rhythms in cognition. Physiological Review 90: 1195–1268. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 29. Lehnertz K (2011) Assessing directed interactions from neurophysiological signals–an overview. Physiological Measurement 32: 1715–1724. [DOI] [PubMed] [Google Scholar]
  • 30. Carandini M, Mechler F, Leonard CS, Movshon JA (1996) Spike train encoding by regular-spiking cells of the visual cortex. Journal of Neurophysiology 76: 3425–3441. [DOI] [PubMed] [Google Scholar]
  • 31. Rauch A, Camera GL, Luscher H, Senn W, Fusi S (2003) Neocortical pyramidal cells respond as integrate-and-fire neurons to in vivo-like input currents. Journal of Neurophysiology 90: 1598–1612. [DOI] [PubMed] [Google Scholar]
  • 32. Burkitt AN (2006) A review of the integrate-and-fire neuron model: I. homogeneous synaptic input. Biological Cybernetics 95: 1–19. [DOI] [PubMed] [Google Scholar]
  • 33. Burkitt AN (2006) A review of the integrate-and-fire neuron model: Ii. inhomogeneous synaptic input and network properties. Biological Cybernetics 95: 97–112. [DOI] [PubMed] [Google Scholar]
  • 34.Tuckwell H (1988) Introduction to theoretical neurobiology. New York: Cambridge University Press.
  • 35.Gerstner W, Kistler WM (2002) Spiking neuron models: Single neurons, populations, plasticity. Cambridge: Cambridge University Press.
  • 36. Somers DC, Nelson SB, Sur M (1995) An emergent model of orientation selectivity in cat visual cortical simple cells. Journal of Neuroscience 15: 5448–5465. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 37. Troyer TW, Krukowski AE, Priebe NJ, Miller KD (1998) Contrast-invariant orientation tuning in cat visual cortex: Thalamocortical input tuning and correlation-based intracortical connectivity. Journal of Neuroscience 18: 5908–5927. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 38. Tao L, Shelley M, McLaughlin DW, Shapley R (2004) An egalitarian network model for the emergence of simple and complex cells in visual cortex. Proceedings of National Academy of Sciences of the United States of America 101: 366–371. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 39. Cai D, Rangan AV, McLaughlin DW (2005) Architectural and synaptic mechanisms underlying coherent spontaneous activity in v1. Proceedings of National Academy of Sciences of the United States of America 102: 5868–5873. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 40. Rangan AV, Cai D, McLaughlin DW (2005) Modeling the spatiotemporal cortical activity associated with the line-motion illusion in primary visual cortex. Proceedings of National Academy of Sciences of the United States of America 102: 18793–18800. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 41. Rangan AV, Cai D (2007) Fast numerical methods for simulating large-scale integrate-and-fire neuronal networks. Journal of Computational Neuroscience 22: 81–100. [DOI] [PubMed] [Google Scholar]
  • 42. Zhou D, Rangan AV, Mclaughlin DW, Cai D (2013) Spatiotemporal dynamics of neuronal population response in the primary visual cortex. Proceedings of National Academy of Sciences of the United States of America 110: 9517–9522. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 43. Granger C (1969) Investigating causal relations by econometric models and crossspectral methods. Econometrica 37: 424–438. [Google Scholar]
  • 44. Geweke J (1982) Measurement of linear dependence and feedback between multiple time series. Journal of the American Statistical Association 77: 304–313. [Google Scholar]
  • 45. Geweke J (1984) Measures of conditional linear dependence and feedback between time series. Journal of the American Statistical Association 79: 907–915. [Google Scholar]
  • 46. Bressler SL, Seth AK (2011) Wiener-granger causality: a well established methodology. NeuroImage 58: 323–329. [DOI] [PubMed] [Google Scholar]
  • 47. Barnett L, Barrett AB, Seth AK (2009) Granger causality and transfer entropy are equivalent for gaussian variables. Physical Review Letters 103: 238701. [DOI] [PubMed] [Google Scholar]
  • 48. Upadhyay J, Silver A, Knaus TA, Lindgren KA, Ducros M, et al. (2008) Effective and structural connectivity in the human auditory cortex. The Journal of Neuroscience 28: 3341–3349. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 49. Damoiseaux JS, Greicius MD (2009) Greater than the sum of its parts: a review of studies combining structural connectivity and resting-state functional connectivity. Brain Struct Funct 213: 525–533. [DOI] [PubMed] [Google Scholar]
  • 50. Kispersky T, Gutierrez GJ, Marder E (2011) Functional connectivity in a rhythmic inhibitory circuit using granger causality. Neural Systems & Circuits 1: 9–23. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 51. Battaglia D, Witt A, Wolf F, Geisel T (2012) Dynamic effective connectivity of inter-areal brain circuits. PLoS Computational Biology 8: e1002438. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 52. Matsumura M, Chen D, Sawaguchi T, Kubota K, Fetz EE (1996) Synaptic interactions between primate precentral cortex neurons revealed by spike-triggered averaging of intracellular membrane potentials in vivo. The Journal of Neuroscience 16: 7757–7767. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 53. Bhalla US (2008) How to record a million synaptic weights in a hippocampal slice. PLoS Computational Biology 4: e1000098. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 54. Rabinovich MI, Varona P, Selverston AI, Abarbanel H (2006) Dynamical principles in neuroscience. Reviews of Modern Physics 78: 1213–1265. [Google Scholar]
  • 55. Seth AK (2005) Causal connectivity of evolved neural networks during behavior. Network: Computation in Neural Systems 16: 35–54. [DOI] [PubMed] [Google Scholar]
  • 56. Seth AK (2008) Causal networks in simulated neural systems. Cognitive Neurodynamics 2: 49–64. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 57.Dayan P, Abbott L (2001) Theoretical neuroscience. Cambridge: MIT Press.
  • 58. Zhou D, Rangan AV, Sun Y, Cai D (2009) Network-induced chaos in integrate-and-fire neuronal ensembles. Physical Review E 80: 031918. [DOI] [PubMed] [Google Scholar]
  • 59. Sun Y, Zhou D, Rangan AV, Cai D (2009) Library-based numerical reduction of the hodgkinhuxley neuron for network simulation. Journal of Computational Neuroscience 27: 369–390. [DOI] [PubMed] [Google Scholar]
  • 60. Komatsu Y, Nakajima S, Toyama K, Fetz EE (1988) Intracortical connectivity revealed by spiketriggered averaging in slice preparations of cat visual cortex. Brain Research 442: 359–362. [DOI] [PubMed] [Google Scholar]
  • 61. de Boer F, Kuyper P (1968) Triggered correlation. IEEE Transactions on Biomedical Engineering 15: 169–179. [DOI] [PubMed] [Google Scholar]
  • 62. Bhalla US (2008) How to record a million synaptic weights in a hippocampal slice. PLoS Computational Biology 4: e1000098. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 63.Pandit S, Wu S (1983) Time series and system analysis with applications. New York: Wiley.
  • 64.McQuarrie A, Tai CL (1998) Regression and time series model selection. New Jersey: World Scientific.
  • 65. Lewicki MS (1998) A review of methods for spike sorting: the detection and classification of neural action potentials. Network 9: R53–78. [PubMed] [Google Scholar]
  • 66. Buzsaki G (2004) Large-scale recording of neuronal ensembles. Nature Neuroscience 7: 446–451. [DOI] [PubMed] [Google Scholar]
  • 67. Brown EN, Kass RE, Mitra PP (2004) Multiple neural spike train data analysis: state-of-the-art and future challenges. Nature Neuroscience 7: 456–461. [DOI] [PubMed] [Google Scholar]
  • 68. Perkel DH, Gerstein GL, Moore GP (1967) Neuronal spike trains and stochastic point processes. i. the single spike train. Biophysical Journal 7: 391–418. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 69. Perkel DH, Gerstein GL, Moore GP (1967) Neuronal spike trains and stochastic point processes. ii. simultaneous spike trains. Biophysical Journal 7: 419–440. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 70.Snyder D, Miller M (1991) Random point processes in time and space, 2nd ed. New York: Springer-Verlag.
  • 71.Daley D, Vere-Jones D (2003) An Introduction to the Theory of Point Process, 2nd ed. New York: Springer-Verlag.
  • 72. Dhamala M, Rangarajan G, Ding M (2008) Estimating granger causality from fourier and wavelet transforms of time series data. Physical Review Letters 100: 018701. [DOI] [PubMed] [Google Scholar]
  • 73. Dhamala M, Rangarajan G, Ding M (2008) Analyzing information flow in brain networks with nonparametric granger causality. NeuroImage 41: 354–362. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 74. Nedungadi AG, Rangarajan G, Jain N, Ding M (2009) Analyzing multiple spike trains with nonparametric granger causality. Journal of Computational Neuroscience 27: 55–64. [DOI] [PubMed] [Google Scholar]
  • 75. Lungarella M, Sporns O (2006) Mapping information flow in sensorimotor networks. PLoS Computational Biology 2: e144. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 76. Truccolo W, Eden UT, Fellows MR, Donoghue JP, Brown EN (2005) A point process framework for relating neural spiking activity to spiking history, neural ensemble, and extrinsic covariate effects. Journal of Neurophysiology 93: 1074–1089. [DOI] [PubMed] [Google Scholar]
  • 77. Okatan M, Wilson MA, Brown EN (2005) Analyzing functional connectivity using a network likelihood model of ensemble neural spiking activity. Neural Computation 17: 1927–1961. [DOI] [PubMed] [Google Scholar]
  • 78. Kim S, Putrino D, Ghosh S, Brown EN (2011) A granger causality measure for point process models of ensemble neural spiking activity. PLoS Computational Biology 7: e1001110. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 79. Wang XJ, Buzsaki G (1996) Gamma oscillation by synaptic inhibition in a hippocampal interneuronal network model. Journal of Neuroscience 16: 6402–6413. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 80. Fourcaud-Trocme N, Hansel D, van Vreeswijk C, Brunel N (2003) How spike generation mechanisms determine the neuronal response to fluctuating inputs. Journal of Neuroscience 23: 11628–11640. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 81. Badel L, Lefort S, Berger TK, Petersen CCH, Gerstner W, et al. (2008) Extracting non-linear integrate-and-fire models from experimental data using dynamic iv curves. Biological Cybernetics 99: 361–370. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 82. Zhang L, McBain CJ (1995) Potassium conductances underlying repolarization and afterhyperpolarization in rat ca1 hippocampal interneurones. Journal of Physiology 488: 661–672. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 83. Nowak LG, Azouz R, Sanchez-vives MV, Gray CM, McCormick DA (2003) Electrophysiological classes of cat primary visual cortical neurons in vivo as revealed by quantitative analyses. Journal of Neurophysiology 89: 1541–1566. [DOI] [PubMed] [Google Scholar]
  • 84. Geisler C, Brunel N, Wang XJ (2005) Contributions of intrinsic membrane dynamics to fast network oscillations with irregular neuronal discharges. Journal of Neurophysiology 94: 4344–4361. [DOI] [PubMed] [Google Scholar]
  • 85. Brette R, Gerstner W (2005) Adaptive exponential integrate-and-fire model as an effective description of neuronal activity. Journal of Neurophysiology 94: 3637–3642. [DOI] [PubMed] [Google Scholar]
  • 86. Koch MA, Norris DG, Hund-Georgiadis M (2002) An investigation of functional and anatomical connectivity using magnetic resonance imaging. NeuroImage 16: 241–250. [DOI] [PubMed] [Google Scholar]
  • 87. Sato JR, Junior EA, Takahashi DY, Felix MdM, Brammer MJ, et al. (2006) A method to produce evolving functional connectivity maps during the course of an fmri experiment using wavelet based time-varying granger causality. NeuroImage 31: 187–196. [DOI] [PubMed] [Google Scholar]
  • 88. Hu S, Liang H (2012) Causality analysis of neural connectivity: New tool and limitations of spectral granger causality. Neurocomputing 76: 44–47. [Google Scholar]
  • 89. Song S, Sjostrom PJ, Reigl M, Nelson S, Chklovskii DB (2005) Highly nonrandom features of synaptic connectivity in local cortical circuits. PLoS Biology 3: e68. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 90. Jia X, Kohn A (2011) Gamma rhythms in the brain. PLoS Biology 9: e1001045. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 91. Emilio S, Sejnowski TJ (2000) Impact of correlated synaptic input on output firing rate and variability in simple neuronal models. The Journal of Neuroscience 20: 6193–6209. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 92. Moreno R, Rocha J, Renart A, Parga N (2002) Response of spiking neurons to correlated inputs. Physical Review Letters 89: 288101. [DOI] [PubMed] [Google Scholar]
  • 93. Brette R (2009) Generation of correlated spike trains. Neural computation 21: 188–215. [DOI] [PubMed] [Google Scholar]
  • 94. Gutig R, Aharonov R, Rotter S, Sompolinsky H (2003) Learning input correlations through nonlinear temporally asymmetric hebbian plasticity. The Journal of Neuroscience 23: 3697–3714. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 95. Newhall K, Kovacic G, Kramer P, Cai D (2010) Cascade-induced synchrony in stochasticallydriven neuronal networks. Physical Review E 82: 041903. [DOI] [PubMed] [Google Scholar]
  • 96. Newhall K, Kovacic G, Kramer P, Zhou D, Rangan AV, et al. (2010) Dynamics of current-based, poisson driven, integrate-and-fire neuronal networks. Communications in Mathematical Sciences 8: 541–600. [Google Scholar]
  • 97.Zhang J, Newhall KA, Zhou D, Rangan AV (2013) Distribution of correlated spiking events in a population-based approach for integrate-and-fire networks. Journal of Computational Neuroscience DOI: 10.1007/s10827-013-0472-6. [DOI] [PubMed]
  • 98.Zhang J, Zhou D, Cai D, Rangan AV (2013) A coarse-grained framework for spiking neuronal networks: between homogeneity and synchrony. Journal of Computational Nueroscience: accepted. [DOI] [PubMed]
  • 99. Yu D, Righero M, Kocarev L (2006) Estimating topology of networks. Physical Review Letters 97: 188701. [DOI] [PubMed] [Google Scholar]
  • 100. Timme M (2007) Revealing network connectivity from response dynamics. Physical Review Letters 98: 224101. [DOI] [PubMed] [Google Scholar]
  • 101. Napoletani D, Sauer T (2008) Reconstructing the topology of sparsely connected dynamical networks. Physical Review E 77: 026103. [DOI] [PubMed] [Google Scholar]
  • 102. Smirnov DA, Bezruchko B (2009) Detection of couplings in ensembles of stochastic oscillators. Physical Review E 79: 046204. [DOI] [PubMed] [Google Scholar]
  • 103. Ren J, Wang WX, Li B, Lai YC (2010) Noise bridges dynamical correlation and topology in coupled oscillator networks. Physical Review Letters 104: 058701. [DOI] [PubMed] [Google Scholar]
  • 104. Levnajic Z, Pikovsky A (2011) Network reconstruction from random phase resetting. Physical Review Letters 107: 034101. [DOI] [PubMed] [Google Scholar]
  • 105. Shandilya SG, Timme M (2011) Inferring network topology from complex dynamics. New Journal of Physics 13: 013004. [Google Scholar]
  • 106. KimWS, Cui XM, Yoon CN, Ta HX, Han SK (2011) Estimating network link weights from inverse phase synchronization indices. Europhysics Letters 96: 20006. [Google Scholar]
  • 107. Prignano L, Diaz-Guilera A (2012) Extracting topological features from dynamical measures in networks of kuramoto oscillators. Physical Review E 85: 036112. [DOI] [PubMed] [Google Scholar]
  • 108.Van Bussel F, Kriener B, Timme M (2011) Inferring synaptic connectivity from spatio-temporal spike patterns. Frontiers in Computational Neuroscience 5 : doi: 10.3389/fncom.2011.00003. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 109. Mirollo RE, Strogatz SH (1990) Synchronization of pulse-coupled biological oscillators. SIAM Journal on Applied Mathematics 50: 1645–1662. [Google Scholar]
  • 110. Marinazzo D, Pellicoro M, Stramaglia S (2008) Kernel method for nonlinear granger causality. Physical Review Letters 100: 144103. [DOI] [PubMed] [Google Scholar]
  • 111. Marinazzo D, Pellicoro M, Stramaglia S (2008) Kernel-granger causality and the analysis of dynamical networks. Physical Review E 77: 056215. [DOI] [PubMed] [Google Scholar]
  • 112.Wiener N (1956) The theory of prediction. In: Beckenbach E, (Ed) Modern mathematics for engineers McGraw-Hill, New York.
  • 113. Seth AK (2010) A matlab toolbox for granger causal connectivity analysis. Journal of Neuroscience Methods 186: 262–273. [DOI] [PubMed] [Google Scholar]
  • 114. Hodgkin AL, Huxley AF (1952) A quantitative description of membrane current and its application to conduction and excitation in nerve. Journal of Physiology 117: 500–544. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 115. Sun Y, Zhou D, Rangan AV, Cai D (2010) Pseudo-lyapunov exponents and predictability of hodgkin-huxley neuronal network dynamics. Journal of Computational Neuroscience 28: 247–266. [DOI] [PubMed] [Google Scholar]
  • 116. Zhou D, Sun Y, Rangan AV, Cai D (2010) Spectrum of lyapunov exponents of non-smooth dynamical systems of integrate-and-fire type. Journal of Computational Neuroscience 28: 229–245. [DOI] [PubMed] [Google Scholar]
  • 117. McLaughlin DW, Shapley R, Shelley M, Wielaard DJ (2000) A neuronal network model of macaque primary visual cortex (v1): Orientation selectivity and dynamics in the input layer 4c alpha. Proceedings of National Academy of Sciences of the United States of America 97: 8087–8092. [DOI] [PMC free article] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Figure S1

GC from a subnetwork to a single neuron. For this nine-neuron network, we can divide it into one subnetwork and one single neuron, where the single neuron corresponds to neuron Inline graphic and the subnetwork corresponds to the remaining eight neurons. Here, the subnetwork is presynaptic to the single neuron. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (the corresponding EPSP is Inline graphicmV). (A) A nine-neuron network with its synaptic connectivity. (B) The constructed causal adjacency matrix Inline graphic which captures the synaptic connectivity in (A). The white color in Inline graphic means there is no causal connection from neuron Inline graphic to neuron Inline graphic, i.e., Inline graphic, and the black color represents the existence of a causal connection from neuron Inline graphic to neuron Inline graphic, i.e., Inline graphic. (C) An effective two-neuron network constructed from (A), where the “neuron Inline graphic” represents the subnetwork that consists of all neurons in (A) except for neuron Inline graphic as indicated by gray boxes (red online) in (B). The neuron Inline graphic represents neuron Inline graphic in (A). The voltage of “neuron Inline graphic” is the mean voltage averaged over all neurons in the subnetwork. (D) The computed causal adjacency matrix for (C), which successfully captures the unidirectional connection from the subnetwork “neuron Inline graphic” to the single neuron labeled by Inline graphic [neuron Inline graphic in (A)].

(EPS)

Figure S2

GC from a single neuron to a subnetwork. For this nine-neuron network, we can divide it into one subnetwork and one single neuron, where the single neuron corresponds to neuron Inline graphic and the subnetwork corresponds to the remaining eight neurons. Here, the subnetwork is postsynaptic to the single neuron. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV). (A) A nine-neuron network with its synaptic connectivity. (B) The constructed causal adjacency matrix Inline graphic which captures the synaptic connectivity in (A). The white color in Inline graphic means there is no causal connection from neuron Inline graphic to neuron Inline graphic, i.e., Inline graphic, and the black color represents the existence of causal connection from neuron Inline graphic to neuron Inline graphic, i.e., Inline graphic. (C) An effective two-neuron network constructed from (A), where neuron Inline graphic represents neuron Inline graphic in (A), “neuron Inline graphic” represents the entire network (A) except for neuron Inline graphic. The voltage of “neuron Inline graphic” is the voltage averaged over all neurons in the subnetwork, as indicated by gray boxes (red online). (D) The computed causal adjacency matrix for (C), which captures the unidirectional causal influence from the single neuron, labeled by Inline graphic [neuron Inline graphic in (A)], to the subnetwork “neuron Inline graphic”.

(EPS)

Figure S3

GC between subnetworks. To construct subnetworks, we divide this fifteen-neuron network into three subnetworks and construct an effective three-“neuron” network. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV). (A) The synaptic adjacency matrix Inline graphic for a fifteen-neuron network. The white color in Inline graphic indicates that there is no synaptic connection from neuron Inline graphic to neuron Inline graphic, i.e., Inline graphic and the black color represents that the neuron Inline graphic is presynaptic to the neuron Inline graphic, i.e., Inline graphic. (B) The causal adjacency matrix Inline graphic constructed by GC, which is identical to Inline graphic. (C) An effective three-neuron network constructed from (A), where the voltage of neuron “Inline graphic”,“Inline graphic” and “Inline graphic” are the averaged response over each group of neurons, respectively. “Neuron Inline graphic” [indicated by the red box in (A)] represents a subnetwork from neuron Inline graphic to neuron Inline graphic, “neuron Inline graphic” [indicated by the blue box in (A)] represents a subnetwork from neuron Inline graphic to neuron Inline graphic, and “neuron Inline graphic” [indicated by the green box in (A)] represents a subnetwork from neuron Inline graphic to neuron Inline graphic. (D) The computed causal adjacency matrix for (C), which captures the effective synaptic connections between the subnetworks.

(EPS)

Figure S4

GC connectivity using spike train. Network reconstruction by GC using the spike train time series of the IInline graphicF model. (A) The coincidence between the synaptic adjacency matrix Inline graphic and the causal adjacency matrix Inline graphic for the two-neuron network in Fig. 1A. The white color indicates that Inline graphic, and the black color for Inline graphic. (B) The absolute difference between Inline graphic and Inline graphic, i.e., Inline graphic, for the hundred-neuron network in Fig. 3A. The white color indicates that Inline graphic, namely, Inline graphic and the black color for Inline graphic. The total number of Inline graphic is Inline graphic out of Inline graphic possible pairs of connections (with Inline graphic in the significance test). (C) Ranked GC in order of magnitude for the hundred-neuron network in Fig. 3A. The gray line (blue online) indicates a threshold in the gap of the ranked GC. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV).

(EPS)

Figure S5

GC analysis using spike train. Illustrated here is the validity of the relations used in the mechanism analysis computed by using the spike trains of the two excitatory neurons of the IInline graphicF network in Fig. 1A with different Poisson input rate Inline graphic for the highly fluctuating regime [(A) and (D)] with Inline graphic, intermediate regime [(B) and (E)] with Inline graphic and mean-driven regime [(C) and (F)] with Inline graphic. The fixed input strength Inline graphic. (A), (B), and (C) are regression coefficients Inline graphic (blue “plus” online), Inline graphic (red “cross” online) and their approximations Inline graphic (“square” symbol), Inline graphic (“circle” symbol) for three different dynamical regimes. (D), (E), and (F) are the GC Inline graphic (red “star” online) as a function of coupling strength Inline graphic for three different dynamical regimes. The line (black online) is a quadratic fit.

(EPS)

Figure S6

GC connectivity for EI Inline graphic F networks. Network reconstruction by GC using the voltage time series of the EIInline graphicF model. (A) The coincidence between the synaptic adjacency matrix Inline graphic and the causal adjacency matrix Inline graphic for the two-neuron network in Fig. 1A. The white color indicates that Inline graphic, and the black color for Inline graphic. (B) The absolute difference between Inline graphic and Inline graphic, i.e., Inline graphic, for the hundred-neuron network in Fig. 3A. The white color indicates that Inline graphic, namely, Inline graphic and the black color for Inline graphic. The total number of Inline graphic is Inline graphic out of Inline graphic possible pairs of connections (with Inline graphic in the significance test). The average neuronal firing rate is Inline graphicHz. (C) Ranked GC in order of magnitude for the hundred-neuron network in Fig. 3A. The gray line (blue online) indicates a threshold in the gap of the ranked GC. Parameters are chosen as Inline graphic (Poisson input rate), Inline graphic (Poisson input strength), and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV).

(EPS)

Figure S7

GC analysis for EI Inline graphic F networks. Illustrated here is the validity of the relations in the mechanism analysis of GC computed by using the voltage time series of the two excitatory neurons of the EIInline graphicF network in Fig. 1A with different Poisson input rate Inline graphic for the highly fluctuating regime [(A) and (D)] with Inline graphic, intermediate regime [(B) and (E)] with Inline graphic and low fluctuating regime [(C) and (F)] with Inline graphic. The fixed input strength Inline graphic. (A), (B), and (C) are regression coefficients Inline graphic (blue “plus” online), Inline graphic (red “cross” online) and their approximations Inline graphic (“square” symbol), Inline graphic (“circle” symbol) for three different dynamical regimes. (D), (E), and (F) are the GC Inline graphic (red “star” online) for three different dynamical regimes. The line (black online) is a quadratic fit.

(EPS)

Figure S8

Minimal data length vs. neuronal firing rate. Illustrated here is the minimum data length required for GC reconstruction of the IInline graphicF network in Fig. 1A as a function of neuronal firing rate. (A) GC reconstruction using voltage time series with firing rate between Inline graphicHz and Inline graphicHz. (B) the same as (A) but using spike train time series. (C) the same as (A) but with firing rate between Inline graphicHz and Inline graphicHz. (D) the same as (B) but with firing rate between Inline graphicHz and Inline graphicHz. The Poisson input strength Inline graphic is chosen as Inline graphic [red “star”, the line is for guiding the eye only.], Inline graphic [blue “circle”, the line is for guiding the eye only.] and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV). The Poisson input rate Inline graphic is chosen to satisfy the corresponding neuronal firing rate.

(EPS)

Figure S9

GC ratio vs. the percentage of common Poisson input. Illustrated here are the GC ratios Inline graphic and Inline graphic for the IInline graphicF network in Fig. 1A. Neuron Inline graphic and neuron Inline graphic are driven by two independent background Poisson inputs with same rate Inline graphic and same strength Inline graphic. In addition, both neurons are also driven by another common Poisson input (independent of their background Poisson input) with rate Inline graphic and strength Inline graphic. The percentage of common Poisson input Inline graphic is defined by Inline graphic. (A) The ratio of computed GC by using voltage time series: Inline graphic as a function of Inline graphic. (B) The ratio of computed GC by using spike train time series: Inline graphic as a function of Inline graphic. In (A) and (B), the red “star” symbol linked by solid line corresponds to the highly fluctuating regime with Inline graphic as shown in Fig. 2A, the blue “circle” symbol linked by solid line corresponds to the intermediate regime with Inline graphic as shown in Fig. 2B and the black “square” symbol linked by solid line corresponds to the mean-driven regime with Inline graphic as shown in Fig. 2C. Parameters in (A) and (B) are chosen as Inline graphic [red “star”, the line is for guiding the eye only.], Inline graphic [blue “circle”, the line is for guiding the eye only.], Inline graphic [black “square”, the line is for guiding the eye only.] and the coupling strength Inline graphic (corresponding to EPSP Inline graphicmV).

(EPS)

Text S1

Computational issues of GC.

(PDF)


Articles from PLoS ONE are provided here courtesy of PLOS

RESOURCES