Abstract
Partial directed coherence (PDC) and directed coherence (DC) which describe complementary aspects of the directed information flow between pairs of univariate components that belong to a vector of simultaneously observed time series have recently been generalized as bPDC/bDC, respectively, to portray the relationship between subsets of component vectors (Takahashi, 2009; Faes and Nollo, 2013). This generalization is specially important for neuroscience applications as one often wishes to address the link between the set of time series from an observed ROI (region of interest) with respect to series from some other physiologically relevant ROI. bPDC/bDC are limited, however, in that several time series within a given subset may be irrelevant or may even interact opposingly with respect to one another leading to interpretation difficulties. To address this, we propose an alternative measure, termed cPDC/cDC, employing canonical decomposition to reveal the main frequency domain modes of interaction between the vector subsets. We also show bPDC/bDC and cPDC/cDC are related and possess mutual information rate interpretations. Numerical examples and a real data set illustrate the concepts. The present contribution provides what is seemingly the first canonical decomposition of information flow in the frequency domain.
1. Introduction
Human behavior is primarily thought as a property that emerges from the interaction of several brain areas, body parts, and the environment. Understanding how these elements dynamically interact is one of major themes of systems neuroscience. Several multivariate time series methods—old and new—have been introduced to describe the interdependence between brain areas using signal modalities like EEG, BOLD signals, MEG and LFP—and are collectively called connectivity measures. Partial directed coherence (PDC) (Baccalá and Sameshima, 2001) and directed coherence/directed transfer function (DC/DTF) (Kamiński and Blinowska, 1991) are two examples of such connectivity measures. Both describe complementary aspects (see Baccalá and Sameshima, 2014 for an in depth discussion) of how information flows between pairs of univariate time series components that belong to a multivariate vector of simultaneously observed time series (Takahashi et al., 2010). Recently, PDC and DC have been generalized (as bPDC/bDC, respectively) to describe how subsets (blocks) of components within a time series vector interrelate (Takahashi, 2009; Faes and Nollo, 2013). This is specially important for neuroscience applications as one often wants to investigate the interaction between sets of time series that are circumscribed to an observed region of interest (ROI) with respect to another physiologically relevant ROI (Nedungadi et al., 2011). The potential relevance of this type of question alone justifies looking for their deeper meaning in terms of information theoretical quantities.
Despite their practical importance, bPDC/bDC suffer from the limitation that several time series within a given subset may be irrelevant or interact in opposition to one another thereby posing interpretation difficulties. Also, in several situations, a researcher may be interested in just the few “best” descriptions of interaction between two sets of time series but not in the total amount of information flowing between them. For a more concrete example, assume that two brain areas interact and that bPDC is large. In this situation, it does not straightforwardly follow that all brain region components are interacting in the same way, or even whether some such components may be ignored. One way to address this limitation is to decompose bPDC/bDC into different components weighed according to relevance.
The aim of this article is twofold: (a) to provide a proper information theoretic interpretation for bPDC/bDC and (b) to introduce a canonical decomposition of information flows, henceforth termed, respectively, canonical PDC/DC (cPDC/cDC). These new decompositions allow us to closely mimic classical canonical correlation analysis so that different dynamically relevant interaction modes between brain areas can be exposed. Due to PDC interpretability in terms of Granger causality (Baccalá and Sameshima, 2014), a consequence of the present formulation is that cPDC represents a long sought frequency domain counterpart to time domain canonical decompositions of Granger causality (Sato et al., 2010; Ashrafulla et al., 2013).
The article is organized as follows. We first introduce the background and notation necessary for the rest of the article (section 2). In the results section (section 3), we first show that both bPDC and bDC between two subsets of processes are block coherences between suitably defined underlying processes. Then, we demonstrate that such coherences are nothing but monotonic transformations of the mutual information rate between the respective processes (Gelfand and Yaglom, 1959; Takahashi et al., 2010; Nedungadi et al., 2011) leading immediately to their interpretability as mutual information rates. Next, we introduce cPDC and cDC and prove that they are the non-zero eigenvalues of the matrices whose determinants underlie the respective bPDC and bDC definitions (section 4). Using simulated examples and publicly available data we illustrate the usefulness of cPDC/cDC (section 5) followed by a brief discussion (section 6). Proof details are left to the Appendix.
2. Background
Let X1, …, XK be K distinct multivariate time series vectors with dimension M1, …, MK. Using T to indicate matrix transposition, let X(t) = [X1(t)T, …, XK(t)T]T for each time t ∈ ℤ be a second order stationary time series with spectral density matrix S(ω) at each frequency ω ∈ [−π, π). To justify our formal computation, we assume that S(ω) is uniformly bounded from below and above and invertible at all frequencies (Hannan, 1970). This is called the boundedness condition which guarantees that the following autoregressive (AR) representation of X holds in the mean square sense
where ϵ(t) = [ϵ1(t)T … ϵK(t)T]T stands for a zero mean innovation process, i.e., 𝔼[ϵ(t)ϵ(t)T] = Σ and 𝔼[ϵ(t)ϵ(l)T] = 0 for l ≠ t. For l ≥ 1, A(l) are (M1 + … + MK)2-dimensional matrices. Let Apq(l) for p, q ∈ {1, …, K} and l ≥ 1 be Mp × Mq-dimensional matrices so that A(l) has the following structure
We define .
Under the boundedness condition, the following moving average (MA) mean square sense representation for the process X also holds
where H(l) for l ≥ 0 are (M1 + … + MK)2-dimensional matrices. Let . We have that Ā*(ω) = H−1(ω) for all ω ∈ [−π, π). The superscript * indicates the matrix complex conjugate.
Let P(ω) = S−1(ω). bPDC from the multivariate process Xj to the process Xi at frequency ω, denoted π(b)ij(ω), is defined (Takahashi, 2009; Faes and Nollo, 2013) by
where det indicates the determinant and the subscript indices relate to the natural block structure associated with the matrices.
Let Θ = Σ−1. bDC from the multivariate process Xj to the process Xi at frequency ω, denoted γ(b)ij(ω), is defined (Takahashi, 2009; Faes and Nollo, 2013) by
Note that the present bDC definition differs slightly from the one in Faes and Nollo (2013). We removed the unnecessary condition of strict causality, i.e., diagonality of Σ, simply by substituting Σ−1jj by Θ−1jj in their definition of bDC as it is more suited for formulating information theoretic results as shown ahead.
Consider a second-order stationary multivariate process W(t) = [Y(t)T Z(t)T]T. The block coherence between Y and Z at frequency ω is defined as (Nedungadi et al., 2011)
Observe that we used the process name in the subscript of the power spectrum S to indicate the corresponding spectral density matrices. In the rest of the article, we will use interchangeably the process name or the corresponding indices in the subscript whenever there is no ambiguity.
Another important definition is that of mutual information rate (MIR) between two multivariate strictly stationary processes Y and Z is
The classical relationship between block coherence (Equation 5) and mutual information rate (Equation 6) follows from
Theorem. (Gelfand and Yaglom, 1959; Pinsker, 1964) If Y and Z are jointly stationary Gaussian processes satisfying the boundedness condition, we have that the MIR between Y and Z is given by
Now, following Takahashi et al. (2010), we define, for i ∈ {1, …, K}, the partialized process ηi by
where 𝔼[⊙|⊙] henceforth denotes the best linear conditional predictor. Likewise the partialized innovation process ζi for i ∈ {1, …, K} is
Observe that both partialized process and partialized innovation process were defined in Takahashi et al. (2010) but for the special case of scalar ηi and ζi.
3. Relation between bPDC/bDC and mutual information rate
Our first result establishes the relationship between bPDC and block coherence and is analogous to Theorem 1 in Takahashi et al. (2010).
Theorem 1. Let X satisfy the boundedness condition. For all i, j ∈ {1, …, K} and all frequencies ω ∈ [−π, π) we have that
A straightforward corollary is
Corollary 1. Let X be a stationary Gaussian process and satisfy the boundedness condition. For all i, j ∈ {1, …, K} we have that
Similar results also hold for bDC.
Theorem 2. Let X satisfy the boundedness condition. For all i, j ∈ {1, …, K} and all frequencies ω ∈ [−π, π) we have that
and
Corollary 2. Let X be a stationary Gaussian process and satisfy the boundedness condition. For all i, j ∈ {1, …, K}, we have that
4. Canonical PDC and DC
Canonical correlation is a classical method developed initially by Hotelling (1936) to address the relationship between random vectors. Brillinger (1981) generalized the method for time series and gave an excellent account of the relationship between canonical correlation analysis and different ideas in multivariate statistics. Our formulation of canonical coherence is equivalent to the definition introduced by Brillinger (1981).
Let Y and Z be respectively MY- and MZ-dimensional jointly second order stationary processes. To better understand the relationship between Y and Z, we can ask the following question: Which components of Y and Z are most representative of the interaction between the processes? One way to formalize this is to consider filtering matrices BY(l) (1 × MY) and BZ(l) (1 × MZ), for all l ∈ ℤ and define the scalar processes bY and bZ by
and
so that CbYbZ(ω) is maximized for all ω ∈ [−π, π). If furthermore Y and Z are jointly stationary Gaussian processes, then this is equivalent to maximizing MIRbYbZ.
Following the above idea, we define the first canonical coherence between Y and Z at frequency ω by
Assume that the supremum (Equation 16) is achieved for bY and bZ, which we call first canonical time series. Consider the residual processes Y1(t) = Y(t) − 𝔼[Y(t)| {bY(l), l ∈ ℤ}] and Z1(t) = Z(t) − 𝔼[Z(t)| {bZ(l), l ∈ ℤ}]. Observe that Y1 and Z1 are uncorrelated to the processes bY and bZ, respectively. The second canonical coherence C(c2)YZ(ω) is defined recursively on the residues by C(c2)YZ(ω) = C(c1)Y1Z1(ω).
Analogously, for 2 ≤ m ≤ min{MY, MZ}, considering the residual processes
and
one may define the m-th canonical coherence as
In this way, it is possible to construct a hierarchy of coherences where each element captures the dependence structure that is not explained by the other elements.
Finally, we introduce cPDC and cDC. For m ≤ min{Mi, Mj}, the m-th canonical PDC from j to i at frequency ω denoted π(cm)ij(ω) is defined by
Similarly, the m-th canonical DC from j to i at frequency ω denoted γ(cm)ij(ω) is defined by
At first sight, it is unclear whether the canonical PDC and DC exist at all or even if they are uniquely defined. More importantly, nor is it obvious that it is possible to compute them. Despite these initial uncertainties, we show next that canonical coherences are consistently defined as the non-null eigenvalues of some specific matrices.
Let λm(Q) denote its m-th eigenvalue from matrix Q ordered from its largest to its smallest value. The following theorem furnishes a practical way to calculate cPDC and cDC.
Theorem 3. Under the boundedness condition for X the following identities hold:
and
Furthermore it is possible to relate bPDC/bDC and cPDC/cDC via
Theorem 4. Under the same conditions of Theorem 3 the following identities hold:
and
A simple consequence of Equations (22), (23) is that for stationary Gaussian processes satisfying the boundedness condition, we now have a decomposition of the mutual information rates
and
Note how the quantities being summed in Equations (24), (25) are formally themselves contributions to the mutual information written in terms of their canonical coherence contributions.
5. Illustrations
5.1. Simulated models
Example 1. To provide insight into cPDC behavior, we begin with a very simple example that can be fully and explicitly solved.
Let a vector of observed time series [Y1, Y2, Y3, Y4] be a real valued autoregressive process of order p = 1 and Σ = I. The autoregressive coefficients of the model are described by
as in Figure 1.
Figure 1
By adopting time series blocks as X1 = [Y1Y2] and X2 = [Y3Y4], when e = f = g = h = 0, direct computation shows that the canonical PDC from block X2 to X1 is zero, i.e., π(c1)12(ω) = π(c2)12(ω) = 0 for all ω (reflecting the nullity of the 2 × 2 A(l) right side upper block), whereas the coupling in the opposite direction contributes two distinct components:
and
For ad = bc—i.e., if the lower left 2× 2 block determinant of A(l) is zero as well, the total number of non-zero cPDC components reduces to just 1.
Even if e, f, g, h are non-zero, i.e., regardless of intrablock dynamics, a = b = 0 suffices to produce the single non-zero π(c1)21(ω) component (shown in Figure 2A) since block X1 interacts with block X2 exclusively through Y4, i.e., π(c2)21(ω) ≡ 0. In this case, since only Y4 is directly impacted by the interaction, only one combined source of variance exists even though two links exist between the blocks. Likewise if b = d = 0, even though two links leave X1, there is only one dynamical component that counts.
Figure 2
This contrasts with the situation when b = c = 0 where two non-zero π(c2)21(ω) coexist (Figure 2B) regardless of the values of e, f, g, h which, nonetheless, contribute to the relative size of the components.
Example 2. In the next example, a 10-variate time series (Y1, …, Y10) follows the connectivity diagram represented in Figure 3. The multivariate time series is divided into four blocks (X1, X2, X3, and X4), where X4 only sends information and X3, which is an integrative block, only receives information. Block X1 has two functionally distinct internal parts, and only one is reached by outside influence. The scenario is fairly complicated and we next illustrate cPDC/cDC usefulness for understanding the underlying dynamic interaction between blocks.
Figure 3
To help interpret the results, we begin by describing the non-zero model coefficients and their dynamical effects. Observe that the model subscript indices in this example indicate the corresponding scalar process and not the block number.
Block X1 = [Y1Y2Y3Y4Y5]
Block X2 = [Y6Y7]
Block X3 = [Y8Y9]
Block X4 = [Y10]
The resulting cPDC components can be appreciated in Figure 4 for |a| = 1. Among their interesting features is the existence of the notch filtered link from X1 to X2 and to X3 at midband. The effects of the low frequency dynamics due to Y1 and the midband resonance due to [Y4 and Y5] manifests itself as the strongest component from X1 to X3. Likewise the single link effect from X2 to X3 is readily apparent as the higher frequency resonances from X4 toward both X1 and X2. Both X3 components are identically equal to 1 since nothing leaves the block.
Figure 4
The corresponding cDCs are portrayed in Figure 5 for a = −1 with no signal reachability from X4 to X3. This contrasts markedly with Figure 6 for a = 1 where X4's indirect effects on X3 are not balanced out.
Figure 5
Figure 6
The effects of the notch connections are readily apparent in both cases. For example, the power associated with the notch frequencies are the local components to X2 and X3 and cannot be attributed to outside influence. For block X1 only one of the five components is different from 1 reflecting the contribution coming from X4.
5.2. Empirical data
This example is based on EEG data borrowed from Sameshima et al. (2014) (Ex. 7.7), which describes a left mesial temporal ictal episode monitored using an extended 10–20 system. The midline electrodes were excluded and left (L) and right (R) side electrodes were grouped as to whether they were frontal (F), central (C), parietal (P), temporal (T) or occipital (O) leading to the canonical PDCs portrayed in Figure 7 where the most important connecting blocks share a dominant low pass frequency canonical component of fairly identical shape pointing to the existence of a shared dominant connectivity dynamics behind the observation, see Figure 8A. Their connectivity is further summarized in Figure 8B.
Figure 7
Figure 8
6. Discussion
We showed that bPDC/bDC introduced in Takahashi (2009) and Faes and Nollo (2013) are block coherences between properly chosen vector time series. When the time series are Gaussian, this implies that bPDC/bDC represent mutual information rates between well defined underlying vector time series. This fully generalizes the results presented in Takahashi et al. (2010). To enhance the understanding of the possibly complex interaction between multiple time series and overcome some bPDC/bDC limitations, we showed that the latter can be decomposed in canonical terms that we call cPDC/cDC. These decompositions represent the various different modes of interaction whereby sets of time series interact. We introduced an explicit way to compute these new quantities and proved some of their properties. The usefulness of cPDC/cDC was illustrated by three examples.
6.1. bPDC and BDC as block coherences
Takahashi et al. (2010) showed that PDC from the j-th scalar time series to the i-th scalar time series is the coherence between the i-th innovation process and the j-th partialized process with a similar result for DC. It is natural to ask whether an analogous result holds for bPDC and bDC. We showed that this is indeed the case where bPDC/bDC represent block coherences relating subsets of adequately defined innovations/partialization processes (Takahashi, 2009; Nedungadi et al., 2011). At first sight these identities may seem surprising as both bPDC and bDC are fully multivariate and directional measures of dependence, whereas block coherences are at once block-pairwise and symmetric measures of dependence. Yet careful reading of Theorems 1 and 2 highlights that bPDC/bDC from j to i and bPDC/bDC from i to j are, in general, block coherences between distinct pairs of vector processes which explains their asymmetric nature and lends them their directed connectivity character. Also, we note that for both bPDC and bDC, the coherences involve innovation process subsets which explains their fully multivariate characteristic as measures. Another interesting observation is that since the innovation processes are uncorrelated to the past of the partialized processes by construction, in the case of bPDC only innovations in the past of the partialized process contribute to the coherence which explains why bPDC is a directed measure of dependence. An analogous observation holds for bDC. In the Gaussian case, the bPDC/bDC representation as a block coherence allows relating them to the mutual information rate between suitably chosen time series. Formally this justifies the idea that these quantities are de facto measures of information flow. For an interesting comparison between bPDC/bDC and Geweke's measure of linear feedback see Faes and Nollo (2013). As a small note for the reader, we observe that our definition of bPDC/bDC is slightly more general than the one proposed by Faes and Nollo (2013) because the covariance matrix of the innovations does not need to be diagonal as they assumed.
6.2. Canonical decomposition of directional measures
Given a pair of random vectors, it is natural to ask how to measure/represent dependence between them. In statistics, there are two main methods, both inspired by the basic Pearson correlation, to address this. The first one generalizes Pearson correlation directly using the determinants of the covariance matrix between and within each set of random variables. For time series, the equivalent measure in the frequency domain is the block coherence and the directed versions are bPDC and bDC. A second generalization rests on the idea of canonical correlation introduced by Hotelling (1936). There are several generalizations of canonical correlation for time series taylored specifically to infer Granger causality in the time domain (Sato et al., 2010; Wu et al., 2011), but, to the best of our knowledge, cPDC and cDC are the first proposals of canonical measures of directed dependence in the frequency domain.
One advantage of cPDC/cDC over bPDC/bDC is that canonical decomposition allows inferring the various different existing modes of interaction between sets of time series in close analogy to what is done for classical canonical correlation and principal component analyses. One should expect this to be useful when several signals are redundant, generated by similar mechanisms, or when there are several time series that do not significantly contribute to the interaction between sets of time series, e.g., when there are many brain areas that are not interacting with each other during some specific behavior. Besides, as we show in Theorem 4, we can recover the bPDC/bDC from the cPDC/cDC.
6.3. Interpreting cPDC/cDC
The main practical interest of cPDC/cDC is to allow the simplification of connectivity interpretations whilst giving new insights into the dynamical interaction between neural structures. We illustrated the achievable simplification using an EEG data set from an epileptic patient. We also showed how cPDC is related to the number of “modes” of interaction between sets of time series through the simple numerical Example 1 and via the slightly more complex Example 2. We expect that cPDC/cDC together with bPDC/bDC become useful tools for handling high dimensional data sets that are increasingly being recorded by several researchers.
We propose that a reasonable way to understand the usefulness of cPDC/cDC is to make an analogy with classical principal component and canonical correlation analyses. Therefore, similar heuristics could be applied in practical situations, for example, to decide the number of different components to include in the interpretation. The canonical time series bY and bZ from section 4 (see also Brillinger, 1981) are analogous to the canonical variables from the classical canonical correlation analysis and can play a similar role for result interpretation.
Finally we remark that the computational procedures used for the present paper will be made available the PDC homepage at http://www.lcs.poli.usp.br/~baccala/pdc/canon together with the data used in section 5.2.
Conflict of interest statement
The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
Statements
Acknowledgments
CNPq Grants 307163/2013-0 to Luiz A. Baccalá and 309381/2012-6 to Koichi Sameshima are also gratefully acknowledged and to NAPNA—Núcleo de Neurociência Aplicada from the University of São Paulo. Part of this work took place during FAPESP Grant 2005/56464- 9 (CInAPCe). Daniel Y. Takahashi was partially supported by Pew Latin American Fellowship and Ciência sem Fronteiras Fellowship-CNPq grant (246778/2012-1).
Conflict of interest
The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
References
1
AshrafullaS.HaldarJ. P.JoshiA. A.LeahyR. M. (2013). Canonical Granger causality between regions of interest. Neuroimage83, 189–199. 10.1016/j.neuroimage.2013.06.056
2
BaccaláL. A.SameshimaK. (2001). Partial directed coherence: a new concept in neural structure determination. Biol. Cybern. 84, 463–474. 10.1007/PL00007990
3
BaccaláL. A.SameshimaK. (2014). Multivariate time series brain connectivity: a sum up, in Methods in Brain Connectivity Inference Through Multivariate Time Series Analysis, eds SameshimaK.BaccaláL. A. (Boca Raton: CRC Press), 245–251. 10.1201/b16550-18
4
BrillingerD. R. (1981). Time Series: Data Analysis and Theory. Classics in applied mathematics. Vol. 36. San Francisco, CA: SIAM, Society for Industrial and Applied Mathematics; Holden-Day.
5
FaesL.NolloG. (2013). Measuring frequency domain Granger causality for multiple blocks of interacting time series. Biol. Cybern. 107, 217–232. 10.1007/s00422-013-0547-5
6
GelfandI. M.YaglomA. M. (1959). Calculation of amount of information about a random function contained in another such function. Am. Math. Soc. Transl. Ser. 2, 3–52.
7
HannanE. J. (1970). Multiple Time Series (Wiley Series in Probability and Mathematical Statistics). New York, NY: Wiley. 10.1002/9780470316429
8
HotellingH. (1936). Relations between two sets of variates. Biometrika28, 321–377. 10.2307/2333955
9
KamińskiM.BlinowskaK. J. (1991). A new method of the description of the information flow in brain structures. Biol. Cybern. 65, 203–210. 10.1007/BF00198091
10
LütkepohlH. (1996). Handbook of Matrices. Chichester: John Wiley.
11
NedungadiA. G.DingM.RangarajanG. (2011). Block coherence: a method for measuring the interdependence between two blocks of neurobiological time series. Biol. Cybern. 104, 197–207. 10.1007/s00422-011-0429-7
12
PinskerM. S. (1964). Information and Information Stability of Random Variables and Processes. San Francisco, CA: Holden-Day.
13
SameshimaK.TakahashiD. Y.BaccaláL. A. (2014). Asymptotic PDC properties, in Methods in Brain Connectivity Inference through Multivariate Time Series Analysis, eds SameshimaK.BaccaláL. A. (Boca Raton: CRC Press), 113–131. 10.1201/b16550-9
14
SatoJ. R.FujitaA.CardosoE. F.ThomazC. E.BrammerM. J.AmaroE.Jr. (2010). Analyzing the connectivity between regions of interest: an approach based on cluster Granger causality for fMRI data analysis. Neuroimage52, 1444–1455. 10.1016/j.neuroimage.2010.05.022
15
TakahashiD. Y. (2009). Medidas de Fluxo de Informação com Aplicação em Neurociência. Ph.D. thesis, University of São Paulo. Available online at: http://www.teses.usp.br/teses/disponiveis/95/95131/tde-07062011-115256/en.php
16
TakahashiD. Y.BaccaláL. A.SameshimaK. (2010). Information theoretic interpretation of frequency domain connectivity measures. Biol. Cybern. 103, 463–469. 10.1007/s00422-010-0410-x
17
WuG. R.ChenF.KangD.ZhangX.MarinazzoD.ChenH. (2011). Multiscale causal connectivity analysis by canonical correlation: theory and application to epileptic brain. IEEE Trans. Biomed. Eng. 58, 3088–3096. 10.1109/TBME.2011.2162669
A. Appendix
A.1. Proof of Theorems 1 and 2 and Corollaries 1 and 2
The proofs in this section follow the pattern of those in Takahashi et al. (2010). The chief difference lies in the care needed regarding the order of the products between the defining matrices. Here we exhibit the main proof ingredients for reader convenience, with further details available in Takahashi (2009) and Takahashi et al. (2010).
Proof of Theorem 1 and Corollary 1. Let W = [YT ZT]T be a second order stationary process satisfying the boundedness condition, using the following well known identity for determinants (Lütkepohl, 1996)
leads to
under Equation (5).
Rewrite bPDC as
so that using the following identities proved in Takahashi et al. (2010)
and for all ω ∈ [−π, π)
back substituted into Equation (A4) leads to
so that using Equation (A2) shows that the right-hand side of Equation (A8) actually is C(b)ϵiηj(ω) as we set out to prove. Corollary 1 is immediate from Theorem 1 and Equation (7). □
Proof of Theorem 2 and Corollary 2. Theorem 2 is obtained by rewriting C(b)Xiζj(ω) using Equation (A3) noting that
and for all ω ∈ [−π, π)
Corollary 2 follows from Theorem 2 and Equation (7). □
A.2. Proof of theorems 3 and 4
Brillinger, (1981, chapter 10) introduced the idea of canonical coherence for time series. We restate his result under our notation as the following theorem.
Theorem 5 (Brillinger, Theorem 10.3.2) Let X and Y be m1 and m2-dimensional time-series jointly satisfying the boundedness condition. For m ≤ min{m1, m2}, the following identity holds:
Proof of Theorem 3. From Equations (18), (A11), we have
Now, from Equations (A5), (A6), and (A7) it follows that
which proves Equation (20).
To prove Equation (21), we use Equations (19), (A12) to obtain
Finally, from Equations (A9), (A10), we have
which concludes the proof. □
Proof of Theorem 4. Rewrite bPDC as
Now, Equation (22) is a straightforward consequence of the relationship between eigenvalues and the determinant of a matrix. A similar argument proves Equation (23). □
Summary
Keywords
directed connectivity measures, canonical decomposition, frequency domain, information flow, generalized coherence
Citation
Takahashi DY, Baccalá LA and Sameshima K (2014) Canonical information flow decomposition among neural structure subsets. Front. Neuroinform. 8:49. doi: 10.3389/fninf.2014.00049
Received
17 January 2014
Accepted
23 April 2014
Published
30 May 2014
Volume
8 - 2014
Edited by
Daniele Marinazzo, University of Gent, Belgium
Reviewed by
Katerina Hlavackova-Schindler, University of Life Sciences, Austria; Angeliki Papana, University of Macedonia, Greece
Copyright
© 2014 Takahashi, Baccalá and Sameshima.
This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.
*Correspondence: Luiz A. Baccalá, Telecommunications and Control Department, Escola Politécnica, University of São Paulo, Av. Prof. Luciano Gualberto, trav. 3,#158, São Paulo, SP 05508-900, Brazil e-mail: baccala@lcs.poli.usp.br
This article was submitted to the journal Frontiers in Neuroinformatics.
Disclaimer
All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.