 Research
 Open Access
 Published:
δMAPS: from spatiotemporal data to a weighted and lagged network between functional domains
Applied Network Science volume 3, Article number: 21 (2018)
Abstract
In real physical systems the underlying spatial components might not have crisp boundaries and their interactions might not be instantaneous. To this end, we propose δMAPS; a method that identifies spatially contiguous and possibly overlapping components referred to as domains, and identifies the lagged functional relationships between them. Informally, a domain is a spatially contiguous region that somehow participates in the same dynamic effect or function. The latter will result in highly correlated temporal activity between grid cells of the same domain. δMAPS first identifies the epicenters of activity of a domain. Next, it identifies a domain as the maximum possible set of spatially contiguous grid cells that include the detected epicenters and satisfy a homogeneity constraint. After identifying the domains, δMAPS infers a functional network between them. The proposed network inference method examines the statistical significance of each lagged correlation between two domains, applies a multipletesting process to control the rate of false positives, infers a range of potential lag values for each edge, and assigns a weight to each edge reflecting the magnitude of interaction between two domains. δMAPS is related to clustering, multivariate statistical techniques and network community detection. However, as we discuss and also show with synthetic data, it is also significantly different, avoiding many of the known limitations of these methods.
We illustrate the application of δMAPS on data from two domains: climate science and neuroscience. First, the seasurface temperature climate network identifies some wellknown teleconnections (such as the lagged connection between the El Nin\(\tilde {o}\) Southern Oscillation and the Indian Ocean). Second, the analysis of resting state fMRI cortical data confirms the presence of known functional resting state networks (default mode, occipital, motor/somatosensory and auditory), and shows that the cortical network includes a backbone of relatively few regions that are densely interconnected.
Introduction
Spatiotemporal data become increasingly prevalent and important for both science (e.g., climate, systems neuroscience, seismology) and enterprises (e.g., the analysis of geotagged social media activity). The spatial scale of the available data is often determined by an arbitrary grid, which is typically larger than the true dimensionality of the underlying system. One major task is to identify the distinct semiautonomous components of this system and to infer their (potentially lagged and weighted) interconnections from the available spatiotemporal data. Traditional dimensionality reduction methods, such as principal component analysis (PCA), independent component analysis (ICA) or clustering, have been successfully used for many years but they have known limitations when the objective is to infer the functional network between all spatial components of the system.
We propose δMAPS, an inference method that first identifies these spatial components, referred to as “domains”, and then the connections between them (“δMAPS” section). Informally, a functional domain (or simply domain) is a spatially contiguous region that somehow participates in the same dynamic effect or function. The exact mechanism that creates this effect or function varies across application domains; however, the key idea is that the functional relation between the grid cells of domain results in highly correlated temporal activity. If we accept this premise, it follows that we should be able to identify the “epicenter” or core of a domain as a point (or subregion) at which the local homogeneity is maximum across the entire domain. Instead of searching for the discrete boundary of a domain, which may not exist in reality, we compute a domain as the maximum possible set of spatially contiguous cells that include the detected core, and that satisfy a homogeneity constraint, expressed in terms of the average pairwise crosscorrelation across all cells in the domain. Domains may be spatially overlapping. Also, some cells may not belong to any domain.
After we identify all domains, δMAPS infers a functional network between them. Different domains may have correlated activity, potentially at a lag, because of direct or indirect interactions. The proposed edge inference method examines the statistical significance of each lagged crosscorrelation between two domains, applies a multipletesting process to control the rate of false positives, infers a range of potential lag values for each edge, and assigns a weight to each edge based on the covariance of the corresponding two domains.
δMAPS is related to clustering, parcellation (or regionalization), network community detection, multivariate statistical methods for dimensionality reduction such as PCA and ICA, as well as functional network and lag inference methods. However, as we discuss in “Related Work” section and show with synthetic data experiments in “Illustration  Comparisons” section, δMAPS is also significantly different than all these methods. δMAPS does not require the number of domains as an input parameter, the resulting domains are spatially contiguous and potentially overlapping, and the inferred connections between domains can be lagged and positively or negatively weighted. Further, the distinction between grid cells that are correlated within the same domain and grid cells that are correlated across two distinct domains allows δMAPS to separate between local diffusion (or dispersion) phenomena and remote interactions that may be due to underlying structural connections (e.g., a whitematter fiber between two brain regions).
In this paper, we extend (Fountalis et al. 2017) by providing a detailed presentation of the method (including a formal proof of the NPcompleteness of the problem) and augment the comparison section (“δMAPS” section) with more results and methods (e.g., kmeans). We proceed with illustrating the application of δMAPS on data from two domains: climate science (“Application in Climate Science” section) and neuroscience (“Applications in fMRI data” section). First, the seasurface temperature (SST) climate network identifies some wellknown climate “teleconnections” (such as the lagged connection between the El Ni\(\tilde {n}\)o Southern Oscillation and the Indian ocean) but it also captures less wellknown lagged connections that deserve further investigation by the domain experts. Second, the analysis of restingstate fMRI cortical data confirms the presence of three wellknown functional brain “networks” (defaultmode, occipital, and motor/somatosensory), and shows that the cortical network includes a backbone of relatively few regions that are densely interconnected.
Related Work
A common approach to reduce the dimensionality of spatiotemporal data is to apply PCA (standard or rotated) or ICA techniques. For instance, in climate science, PCA (also known as Empirical Orthogonal Function (EOF) analysis) has been used to identify teleconnections between distinct climate regions (Storch and Zwiers 2001). The orthogonality between PCA components complicates the interpretation of the results making it difficult to identify the distinct underlying modes of variability and to separate their effects, as clearly discussed in (Dommenget and Latif 2002). ICA analysis is more common in the neuroscience literature, aiming to identify independent rather than orthogonal components (Hyvärinen 1999). However, ICA does not provide a relative significance for each component, and the number of independent components should be chosen based on some additional information about the underlying system.
Another broad family of spatiotemporal dimensionality reduction methods is based on unsupervised clustering. Such algorithms can be grouped into regiongrowing (e.g., (Blumensath et al. 2012; Lu et al. 2003)), spectral (e.g., the NCUT method often applied in fMRI analysis (Craddock et al. 2012; Heuvel et al. 2008) – but also see a discussion of their limitations (Baldassano et al. 2015)), hierarchical (e.g., (Blumensath et al. 2013; Thirion et al. 2014)), probabilistic (e.g., (Baldassano et al. 2015)) or density based methods (Kawale et al. 2013). These groups of algorithms are quite different but they share some common characteristics: the resulting clusters may not be spatially contiguous (Steinbach et al. 2003; Heuvel et al. 2008), every grid cell needs to belong to a cluster (potentially excluding only outliers) (Blumensath et al. 2012; Lu et al. 2003), and the number of clusters is often required as an input parameter (Craddock et al. 2012; Blumensath et al. 2013)  none of these algorithms account for the fact that clusters may overlap. In particular, the lack of spatial contiguity makes it hard to distinguish between correlations due to spatial diffusion (or dispersion) phenomena from correlations that are due to remote (structural) interactions between distinct effects. The proposed method has similar goals (e.g., identification of potentially overlapping spatially contiguous sources of activity) to (Pnevmatikakis et al. 2016) but that method relies mostly on nonnegative matrix factorization. Additionally, δMAPS involves only four hyperparamteters and it is simpler compared to (Pnevmatikakis et al. 2016).
An approach of increasing popularity is to first construct a correlationbased network between individual grid cells, after pruning crosscorrelations that are not statistically significant – see (Kramer et al. 2009). Then, some of these methods analyze the (binary or weighted) celllevel network directly based on various centrality metrics, kcore decomposition, spectral analysis, etc. (e.g., (Donges et al. 2009; van den Heuvel and Sporns 2011)) or they first apply a community detection algorithm (potentially able to detect overlapping communities, e.g., (Ahn et al. 2010; Lancichinetti et al. 2011; Palla et al. 2005)) on the celllevel network and then analyze the resulting communities in terms of size, density, location, overlap, etc. (e.g., (McGuire and Nguyen 2014; Power et al. 2011; Steinhaeuser et al. 2010; 2011)). A community however may group together two regions that are, first, not spatially contiguous, and second, different in terms of how they are connected to other regions; an instance of this issue is illustrated in Fig. 4c in the context of climate data analysis.
δMAPS
Background and definitions
The input data is generated from a spatial field X(t) sampled on an arbitrary gridG. This grid can be modeled as a planar graph G(V,E), where each vertex in V is a grid cell and each edge in E represents the spatial adjacency between two neighboring cells. A set of cells A⊆V is spatially contiguous, denoted by I_{G}(A)=1, if it forms a connected component in G.
The Kneighborhood of a cell i, denoted by Γ_{K}(i), includes i and the set of K nearest neighbors to i according to an appropriate spatial distance metric (e.g., geodesic distance for climate data, Euclidean distance for fMRI data). The Kneighborhood of a cell is always spatially contiguous.
Each grid cell i is associated with a time series x_{i}(t) of length T (t∈{1,…T}). We assume that x_{i}(t) is sampled from a stationary signal and denote by \(\tilde {\mu }_{i}\) and \(\tilde {\sigma }_{i}^{2}\) its sample mean and variance, respectively. The similarity between the activity of two cells i and j is measured with Pearson’s crosscorrelation at zerolag,
Other similarity metrics could be used instead.
The local homogeneity at cell i is defined as the average pairwise crosscorrelation between the K+1 cells in Γ_{K}(i),
Similarly, we define the homogeneity of a set of cells A as the average pairwise crosscorrelation between all distinct cells in A,
Functional domains
Intuitively, a domainA is a spatially contiguous set of cells that somehow participate in the same dynamic effect or function. The exact mechanism that creates this effect or function varies across application domains; however, the key premise is that the functional relation between the cells of domain A results in highly correlated temporal activity (at zerolag), and thus high values of the homogeneity metric \(\hat {r}(A)\). A given homogeneity threshold δ examines if the homogeneity of A is sufficiently high, i.e., a domain A must have \(\hat {r}(A)>\delta \). (the selection of δ is discussed later in this section).
If we accept this premise, it follows that we should be able to identify the “epicenter” or core of a domain A as a cell i∈A at which the local homogeneity \(\hat {r}_{K}(i)\) is maximum across all cells in A (and certainly larger than δ). In general, the core of a domain may not be a unique cell.
More formally now, suppose that we know that cell c is in the core of a domain. The domain A rooted at c has to satisfy the following three properties: it should include cell c, be spatially contiguous, and have higher homogeneity than δ:
The boundaries of the underlying spatial components of a system are, in practice, unknown and may gradually “fade” into other regions dominated by noise. Instead of trying to identify such “fuzzy boundaries” however, we prefer for simplicity to compute a domain as the largest possible set of cells that satisfies the previous three constraints.
Domain identification problem: Given the field X(t) on the spatial gridG, a core cellc, and the thresholdδ, the domainA(c) is a maximumsized set of cells that satisfies the three constraints of (4). In Appendix1 we prove that the decision version of this problem is NPHard.
A given spatial field X(t) may include several domains. The number of identified domains, denoted by N, depends on the threshold δ. Domains may be spatially overlapping; this is the case when the cells of a region are significantly correlated with two or more distinct domain cores. Also, some cells of the grid may not belong to any domain, meaning that their signal can be thought of as mostly noise (at least for the given value of δ). Decreasing δ will typically result in a larger number of detected domain cores. Further, as δ decreases, the spatial extent of each domain will typically increase, resulting in larger overlaps between nearby domains.
δ can simply be a userspecified parameter for the minimum required average crosscorrelation within a domain. Another way is to calculate δ based on a statistical test for the significance of the observed zerolag crosscorrelations as follows.
We start with a random sample of pairs of grid cells and for each pair i,j we compute the Pearson correlation r_{i,j} at zero lag. To assess the significance of each correlation we use Bartlett’s formula (Box et al. 2011). Under the null hypothesis of no coupling r_{i,j} should have zero mean, and a reasonable estimate of its variance is given by
here r_{i,i}(τ_{k}) is the autocorrelation of the time series of grid cell i at lag τ_{k}. The scaled values \(z_{i,j} = \frac { r_{i,j}} { \sqrt { Var[r_{i,j} ]} }\) should approximately follow a standard normal distribution. To assess the significance of each correlation we perform a one sided ztest for a given level of significance α (set to 10^{−2} unless specified otherwise).
The threshold δ is set as the average of all significant correlations. A domain is a set of spatially contiguous grid cells, thus we require that the mean pairwise correlation for the cells belonging to the same domain to be higher than the mean pairwise correlation of randomly picked pairs of grid cells. δ depends on the choice of the significance level α, on the autocorrelation structure of the underlying time series and on the correlation distribution of the field.
Algorithm for domain identification
Given the NPHardness of the previous problem, we propose a greedy algorithm that runs in two phases. In the first phase, we identify a set of cells, referred to as seeds; each seed is a candidate core for a domain. In the second phase, each seed is initially considered as a distinct domain. Then, an iterative and greedy algorithm attempts to identify the largest possible domains that satisfy the three constraints of (4) through a sequence of expansion and merging operations. The two phases are described next, while the complete pseudocode is presented in Appendix2. The source code (including supporting documentation) is available online at https://github.com/deltaMAPS/deltaMAPS_fMRI.
Seed selection Recall that the core of a domain is a cell of maximum local homogeneity across all cells of that domain. So, one way to detect potential core cells, while the domains are still unknown, is to identify points at which the homogeneity field \(\hat {r}_{K}(i)\) is locally maximum. Specifically, cell i is a seed if \(\hat {r}_{K}(i)> \delta \) and \(\hat {r}_{K}(i)\geq \hat {r}_{K}(j)\) ∀j∈Γ_{K}(i). Let S be the set of all identified seeds.
In general, a single domain may produce more than one seed because the local homogeneity field can be noisy and so it may include multiple local maxima, greater than δ. Further, additional seeds can appear in regions where domains overlap. Consequently, it is necessary to include a merging operation in which two or more seeds are eventually merged into the same domain.
Note that as K decreases, the local homogeneity field becomes more noisy and so we may detect more seeds in the same domain. On the other hand, larger values of the neighborhood size K can oversmooth the homogeneity field, removing seeds and potentially hiding entire domains. The latter is more likely if the spatial extent of a domain is smaller than K+1 cells. This observation implies that the spatial resolution of the given grid sets a lower bound on the size of the functional domains that can be detected.
Domainmerging operation Two candidate domains A and B can be merged if they are spatially contiguous and if the homogeneity of their union is sufficiently high, i.e., \(\hat {r}(A\cup B) > \delta \). Whenever there is more than one pair of domains that can be merged, we greedily choose the pair with the maximum union homogeneity; this greedy choice makes the merged domain more likely to expand further.
The merging operation is performed initially on the set of seeds S. It is also performed after each domainexpansion operation, whenever it is possible to do so.
Domainexpansion operation A domain A is expanded by considering all cells that are adjacent to A, and selecting the cell i that maximizes \(\hat {r}(A \cup \{i\})\); again, this greedy choice makes the expanded domain more likely to expand further.
The expansion operation is repeated in rounds. At the start of each round, domains are sorted in decreasing order of homogeneity. Then, each domain is expanded by one cell at a time, as previously described, in that order. After every expansion operation, we check whether one or more merging operations are possible. A round is complete when we have attempted to expand each domain once.
A domain can no longer expand if that would violate the homogeneity constraint δ or if there are no other adjacent cells that can be added into the domain. The domain identification algorithm terminates when no further expansion or merging operations are possible.
The domain network
Given the N identified domains V_{δ}={A_{1},…A_{N}}, the next step is to construct a network G_{δ}(V_{δ},E_{δ}) between domains. Different domains may have correlated activity because of direct or indirect interactions. We refer to G_{δ} as a functional network to emphasize that the edges between domains are based on functional activity and correlations instead of structural or physical connections (“structural network”) or causal interactions (“effective network”).
We associate a domainlevel signal X_{A}(t) with each domain A. The definition of this signal depends on the specific application field. For instance, when we analyze climate anomaly time series, the domainlevel signal is defined as the cumulative anomaly across all cells of that domain, where the contribution of each signal is weighted by the relative size of that cell (it depends on the cell’s latitude). For fMRI data, the domainlevel signal is defined as the average BOLD signal across the cells of that domain.
Two different domains may be located at some distance, and so they may be correlated at a nonzero lag τ. For this reason, we examine if there is a significant crosscorrelation between different domains over a range of lags (−τ_{max}≤τ≤τ_{max}). The sample crosscorrelation between domains A and B at a lag τ can be estimated as:
where \(\tilde {\mu }_{A}\) and \(\tilde {\sigma }_{A}\) denote sample mean and standard deviation estimates, respectively. The selection of τ_{max} should be large enough to include the typical signal propagation delays in the underlying system but at the same time it should be much lower than T. The 2τ_{max}+1 crosscorrelations for a pair of domains can be represented with a correlogram; an example based on climate seasurface temperature data (see “Application in Climate Science” section) is shown in Fig. 1.
The next step is to examine the statistical significance of the measured crosscorrelation between two domains A and B. Two uncorrelated signals can still produce a considerable sample crosscorrelation if they have a strong autocorrelation structure. This is captured by the Bartlett’s formula (Box et al. 2011), which is an estimator for the variance of r_{A,B}(τ), for a fixed value of τ and under the assumption that A and B are two jointly stationary signals with independent, identically distributed normal errors. Under the nullhypothesis that the domainlevel signals of A and B are uncorrelated,
where r_{A,A}(τ_{k}) is the autocorrelation of the time series of domain A at lag τ_{k}.
Under the previous nullhypothesis, the expected value of r_{A,B}(τ) is zero and the following statistic approximately follows the standard normal distribution N(0,1):
The approximation is due to the fact that r_{A,B}(τ) is bounded between [−1,1]. So, we can now perform hypothesis testing for every pair of domains, computing a corresponding pvalue based on z.
Given that there may be several domains in G_{δ}, we need to control the number of false positive edges that may result from the multiple testing problem. We do so using the False Discovery Rate (FDR) method of Benjamini and Hochberg (1995). Specifically, given N domains, we need to perform \(M=\frac {N(N1)}{2}\,(2\tau _{max}+1)\) tests (for each potential edge and for each possible lag value), and compute the pvalue for each test, based on (8). Given a False Discovery Rate q (the expected value of the fraction of tests that are false positives), the BenjaminiHochberg procedure ranks the Mpvalues (p_{i} becomes the i’th lowest pvalue) and only keeps the first m<M tests (edges), where p_{m} is the highest pvalue such that p_{m}<q m/M. ^{Footnote 1}
Lag inference and edge directionality We infer the domainlevel network G_{δ} as follows. Two domains A,B∈V_{δ} are connected if there is at least one lag value at which the crosscorrelation r_{A,B}(τ) has passed the FDR test. The standard approach in lag inference is to consider the lag value τ^{∗} that maximizes the absolute crosscorrelation,
The corresponding correlation is denoted as \(r^{*}_{A,B}\). There are two problems with this approach. First, it is harder to examine the statistical significance of \(r^{*}_{A,B}\) because it is the maximum of a set of random variables.^{Footnote 2} Second, it is often the case that there is a range of lag values that produce “almost maximum” crosscorrelations, say within one standard deviation from each other.
Focusing on \(\tau ^{*}_{A,B}\) and ignoring the rest of the statistically significant and almost equal crosscorrelations is not well justified.
Instead, we follow a more robust approach in which an edge of the domainlevel network G_{δ} may be associated with a range of lag values.^{Footnote 3} The lag range that we associate with the edge between A and B, denoted as R_{τ}(A,B), is defined as the range of lags that produce significant crosscorrelations, within one standard deviation from \(r^{*}_{A,B}\). If R_{τ}(A,B) includes τ=0, the edge is represented as undirected. If R_{τ}(A,B) includes only positive lags, the edge is directed from A to B meaning that A’s signal precedes B’s by the given lag range; otherwise, we associate the opposite direction with that edge. We emphasize that the directionality of the edges does not imply causality; it only refers to temporal ordering.
Edge weight and domain strength How to assign a weight to each domainlevel edge in G_{δ}? A common approach is to consider the (signed) magnitude of the crosscorrelation \(r^{*}_{A,B}\). This is reasonable if all domain signals have approximately the same signal power. In addition, we propose a new edge weight that is based on the covariance of the two domains:
The crosscorrelation is computed at lag \(\tau ^{*}_{A,B}\) but we could use the average of all crosscorrelations in R_{τ}(A,B) instead. The weight of an edge can be positive or negative depending on the sign of the corresponding crosscorrelation.
Finally, the strength of a network node (domain) is defined as the sum of the absolute weights of all edges of that node (ignoring edge directionality).
Illustration  Comparisons
The two objectives of this section are to illustrate how the δMAPS method works, and to contrast the results of the latter with commonly used methods such as PCA, ICA, spatial clustering, and overlapping community detection. We rely on synthetic data so that the groundtruth is known.
Synthetic data description We construct five domains on a 50 ×70 spatial grid. Each domain i is associated with a “mother” time series y_{i}(t), (i=1 …5). To make the experiment more realistic in terms of autocorrelation structure and marginal distribution, each y_{i}(t) is a real fMRI time series with length T=1200 (see “Applications in fMRI data” section). The five mother time series y_{i}(t) are uncorrelated (absolute crosscorrelation < 0.05 at all lags), and they are normalized to zeromean, unitvariance. To create correlations between domains (i.e., domainlevel edges), we construct five new time series x_{i}(t) based on linear combinations of two or more mother time series. For instance, if we set x_{i}(t)=(1−α)y_{i}(t)+αy_{j}(t+τ) with 0<α<1 and x_{j}(t)=y_{j}(t), domains i and j become positively correlated at a lag τ; the correlation increases with α. The time series x_{i} are again normalized to zeromean, unitvariance. We then scale the time series of domain i by a factor \(\sqrt {s_{i}}\) to control the variance of each domain (Var[x_{i}(t)]=s_{i}).
For simplicity, each domain is a circle with radius r_{p}. A domain has a “core region” with the same center and radius r_{c}<r_{p}; the core is supposed to be the epicenter of that domain. Every point in the core has the same signal x_{i}(t) (before we add random noise). Outside the core, the signal attenuates at a distance d from the center of the domain as follows:
Finally, we superimpose white Gaussian noise of zeromean, unitvariance on the entire grid.
The parameters of the five synthetic domains are shown in Table 1. The domains differ in terms of size and power (variance). The spatial extent of the domains is shown in Fig. 2a; domains 1 and 3 overlap with domain 2, while domains 4 and 5 also overlap to a smaller extent. Further, there is a strong and lagged anticorrelation between domains 1 and 3, a weaker positive correlation at zerolag between domains 4 and 5, and an ever weaker positive correlation at zerolag between domains 3 and 5. The edges of the domainlevel network are also shown in Fig. 2a.
δMAPS results The parameters of δMAPS are set as follows: K=4 cells (updownleftright), and δ=0.55 (corresponds to significance level 10^{−2}). In the edge inference step, the FDR threshold is q=10% and τ_{max}=20.
Fig. 2b shows the local homogeneity field \(\hat {r}_{K}(i)\) as well as the identified seeds (blue dots), while Fig. 2c shows the five discovered domains. As expected, we often identify more than one seed in the core of each domain due to noise; those seeds are eventually merged into the same domain. The local homogeneity field is weaker in domains 4 and 5 (due to their lower variance) but a seed is still detected in those domains. Seeds also appear at the two overlapping regions between (1,2) and (2,3) but those seeds gradually merge with one of the domains in which they appear.
Each domain is a subset of the domain’s true expanse. The reason is that some cells close to the periphery of each domain have very low signaltonoise ratio (recall that the signal decays to zero at the periphery and so the average correlation between those cells with the rest of their domain does not exceed the δ threshold). More quantitatively, the inferred domains include about 80%90% of the groundtruth cells in each domain. In nonoverlapping regions this fraction is higher (85%95% of the cells), while in overlapping regions it drops to 45%80%. The extent of overlapping regions is harder to correctly identify especially when a domain (e.g., domain 2) overlaps with a stronger domain (e.g., domains 1 or 3); the stronger domain effectively masks the signal of the weaker domain. The average pairwise crosscorrelation of the cells in each domain varies between 55%70% in the groundtruth data, while the inferred domains have slightly higher average crosscorrelation (65%75%) due to their smaller expanse.
Finally, Fig. 2d shows the inferred domainlevel network. δMAPS identifies correctly the three edges and their polarity (positive versus negative correlations). The lag ranges always include the correct value (e.g., the edge between domains 1 and 3 has a lag range [14,15]). Also, the three edges are correctly ordered in terms of absolute crosscorrelation magnitude: (1,3) followed by (4,5), followed by (3,5).
PCA/EOF results PCA assumes that the dominant patterns are orthogonal in space and time (which is not necessarily true, see (Simmons et al. 1983) for a case relevant to climate). To overcome this problem alternative methods exist (e.g., rotated PCA (Vejmelka et al. 2015)) but require more user defined parameters and some times split a single pattern into two different ones (see (Storch and Zwiers 2001; Dommenget and Latif 2002)).
We apply EOF analysis using Matlab’s PCA toolbox. Figure 2e, f, g show the first three principal components, which collectively account for about 90% of the total variance. A first observation is that domains 4 and 5 are not even visible in these components – they only appear in the next two components, which account for about 5% of the variance each. This is because domains 4 and 5 are smaller and have lower variance. This is a general limitation of PCA: the variance of the analyzed field can be dominated by a small number of “modes of variability”, completely masking smaller/weaker regions of interest and their connections. Second, the first three components do not provide a consistent evidence that domains 1 and 3 are strongly anticorrelated; this is due to their lagged correlation, which is missed by PCA. Third, the first component, which accounts for 40% of the total variance, can be misinterpreted to imply that domain 2 is somehow positively correlated with domains 1 and 3, even though it is actually generated by an uncorrelated signal. This is due to the overlap of domain 2 with domains 1 and 3.
ICA results We apply ICA on the synthetic data using Matlab’s FastICA toolbox. To help ICA perform better, we specified the right number of independent components, which is two (domains 1,3,4,5 are indirectly correlated – domain 2 is not correlated with any other). The two independent components are shown in Fig. 2h, i. Note that only a rough “shadow” of each domain is visible. Domains 1 and 3 appear in different colors, providing a hint that they are anticorrelated, while domains 3 and 5 appear in the same color because they are positively correlated. Overall, however, the components are quite noisy and it would be hard in practice to discover the functional structure of the underlying system if we did not know the groundtruth. The results are even harder to interpret when we request a larger number of components.
Clustering results We apply the most wellknown clustering method, kmeans, on our synthetic data. As commonly done with correlationbased clustering, the distance between two cells i and j is determined by the maximum absolute correlation across all considered lags, as \(1r^{*}_{i,j}\). Figure 2j, k shows the resulting clusters for k=5 (the number of synthetic domains) and 6, respectively. For k=5, domains 1 and 3 form a single cluster because of their strong anticorrelation; the same happens with domains 4 and 5. The connection between domains 3 and 5 is missed, as well as the overlap between domain 2 with domains 1 and 3. Further, two of the five clusters (green and brown) cover just noise. The situation changes completely when we request k=6 clusters. In that case, the overlapping regions in domain 2 form a single cluster, while domains 1 and 3 are separated in different clusters. Another clustering algorithm, resulting in spatially contiguous clusters (Fountalis et al. 2014), is illustrated in “Application in Climate Science” section in the context of climate data analysis (see Fig. 4d).
Community detection results We apply a stateoftheart overlapping community detection method, referred to as OSLOM (Lancichinetti et al. 2011), with the default parameter values. The input to OSLOM is a positively weighted graph: each vertex is a grid cell and an edge between vertices i and j corresponds to the maximum absolute crosscorrelation \(r^{*}_{i,j}\) across all lags of interest. Absolute correlations less than 30% are considered insignificant and the corresponding edges are pruned.^{Footnote 4} As most community detection methods, OSLOM does not distinguish between positive and negative correlations. OSLOM provides a hierarchy of communities. When applied to our synthetic data, the first level of hierarchy (not shown) simply groups together domains 1,2,3 in one community (even though domain 2 is uncorrelated with domains 1 and 3), and domains 4,5 in another community. The connection between domains 3 and 5 is missed. The second level of hierarchy is shown in Fig. 2l. Overall, OSLOM does a better job than PCA/ICA/clustering in detecting the spatial extent of each domain. A small overlap between domains (1,2) and (2,3) is discovered but to a smaller extent than δMAPS. However, a community in OSLOM is not constrained to be spatially contiguous. This is the reason we see some black dots in regions 4 and 5; these are noncontiguous overlaps between the communities that correspond to these two domains.
Application in Climate Science
We first apply δMAPS in the context of climate science. Climate scientists are interested in teleconnections between different regions, and they often rely on EOF analysis to uncover them (Storch and Zwiers 2001). Here, we analyze the monthly SeaSurface Temperature (SST) field from the HadISST dataset (Rayner et al. 2003), covering 50 years (19562005) at a spatial resolution of 2.0^{o}×2.5^{o}, and we focus on the latitudinal range of [60^{o}S;60^{o}N] to avoid seaice covered regions. Following standard practice, we preprocess the time series to form anomalies, i.e., remove the seasonal cycle, remove any longterm trend at each gridpoint (using the TheilSen estimator), and transform the signal to zeromean at each grid point.
δMAPS is applied as follows. We set the local neighborhood to the K=4 nearest cells so that we can identify the smallest possible domains at the given spatial resolution. Grid cells that cover mostly land do not have an SST signal and so they do not participate in the local neighborhood Γ_{K}(i) of any seacovered grid cell i. Second, the homogeneity threshold δ is set to 0.37 (corresponds to a significance level of 10^{−2}). In the edge inference stage, the lag range is τ_{max}=12 months (a reasonable value for largescale changes in atmospheric wave patterns), and the FDR threshold is set to q=3% (we identify about 30 edges and so we expect no more than one false positive).
Figure 3a shows the identified domains (the color code will be explained shortly). The spatial dimensionality has been reduced from about 6000 grid cells to 18 domains. 65% of the seacovered cells belong to at least one domain; the overlapping regions are shown in black and they cover 2% of the grid cells that belong to a domain. The largest domain (domain E) corresponds to the El Ni\(\tilde {n}\)o Southern Oscillation (ENSO), which is also the most important in terms of node strength (see Fig. 3b). Other strong nodes are domain F (part of the “horseshoepattern” surrounding ENSO), domain J (Indian ocean) and domain Q (subtropical Atlantic). The strength of the edges associated with ENSO are shown in Fig. 3c. These findings are consistent with known facts in climate science regarding ENSO and its positive correlation with the Indian ocean and north tropical Atlantic, and negative correlations with the regions that surround it in the Pacific (horseshoepattern) (Klein et al. 1999).
Figure 3d shows the inferred domainlevel network.
The color code represents the (signed) crosscorrelation for each edge. The lag range associated with each edge is shown in Fig. 3e; recall that some edges are not directed because their lag range includes τ=0. The network consists of five weaklyconnected components. If we analyze the largest component (which includes ENSO) as a signed network (i.e., some edges are positive and some negative) we see that it is structurally balanced (Easley and Kleinberg 2010). A graph is structurally balanced if it does not contain cycles with an odd number of negative edges.^{Footnote 5} A structurally balanced network can be partitioned in a “dipole”, so that positive edges only appear within each pole and negative edges appear only between the two poles. In Fig. 3a, the nodes of these two poles are colored as blue and green (the smaller disconnected components are shown in other colors).
Focusing on the lag range of each edge, domain Q seems to play a unique role, as it temporally precedes all other domains in the inferred network. Specifically, its activity precedes that of domains D, E and F by about 510 months. The lead of south tropical Atlantic SSTs (domain Q) on ENSO has recently received significant attention in climate science (RodríguezFonseca et al. 2009; Bracco et al. 2018).
Our results suggest that SST anomalies in domain Q may impact a large portion of the climate system. Stateoftheart climate models are generally unable to reproduce the lead relationship between Q and the other tropical domains (Barimalala et al. 2012). δMAPS could be applied across models and different climate fields to identify the origin and impact of this bias (Bracco et al. 2018).
As expected, some of the edges we detect in the network of Fig. 3d are due to indirect correlations. For instance, if A has a causal effect on B and C, at lags τ_{A,B} and τ_{A,C} respectively (suppose that τ_{A,B}>τ_{A,C}), we may also see a indirect correlation between B and C at a lag τ_{A,B}−τA,C. Or, it may be that A has a causal effect on B at lag τ_{A,B} and B has a causal effect on C at lag τ_{B,C}; in that case we may observe an indirect correlation between A and C at lag τ_{A,B}+τ_{B,C}. Or, it may be of course that the observed correlation between two nodes A and B is due to more than one causal paths that originate at A and terminate at B through one or more nodes.
Switching to lag inference, we say that a triangle is lagconsistent if there is at least one value in the lag range associated with each edge that would place the three nodes in a consistent temporal distance with respect to each other. For instance, in the case of the first triangle of Fig. 3f, the triangle is lagconsistent if the edge from Q to F has a lag of 8 months and the edge between E and F has lag 2 months (meaning that the direction would be from F to E); several other values would make this triangle lagconsistent. We have verified the lagconsistency of every triangle in the climate network. One exception is the triangle between domains (C,D,G), shown at the bottom of Fig. 3f. However, the large lag in the edge from C to G can be explained with the triangle between domains (C,E,G), which is lagconsistent. We emphasize that the temporal ordering that results from these lag relations should not be misinterpreted as causality; we expect that several of the edges we identify are only due to indirect correlations, not associated with a causal interaction between the corresponding two nodes.
For comparison purposes, Fig. 4 shows the results of EOF analysis, community detection, and spatial clustering on the same dataset. The first EOF explains only about 19% of the variance, implying that the SST field is too complex to be understood with only one spatial component. On the other hand, the joint interpretation of multiple EOF components is problematic due to their orthogonal relation (Dommenget and Latif 2002). The anticorrelation between ENSO and the horseshoepattern regions is well captured in the first component but several other important connections, such as the negative and lagged relation between the south subtropical Atlantic and ENSO (domains Q and E, respectively), are missed.
Figure 4c shows the results of the overlapping community detection method OSLOM. Following (Steinhaeuser et al. 2010), the input to OSLOM is a correlationbased celllevel network. Correlations less than 30% are ignored. The weight of each edge is set to the maximum absolute correlation between the corresponding two cells, across all considered lags. OSLOM identifies 22 communities. Community 6 is not spatially contiguous; it covers ENSO, the Indian ocean, a region in the north tropical Atlantic, and a region in south Pacific. This is a general problem with community detection methods: they cannot distinguish high correlations due to a remote connection from correlations due to spatial proximity. In the context of climate, the former may be due to atmospheric waves or largescale ocean currents while the latter may be due to local circulations.
Finally, Fig. 4d shows the results of a spatial clustering method (Fountalis et al. 2014), with the same homogeneity threshold δ we use in δMAPS. That method ensures that every cluster (referred to as “area”) is spatially contiguous but it also requires that there is no overlap between areas and it attempts to assign each grid cell to an area. Consequently, it results in more areas (compared to the number of domains), some of which are just artifacts of the spatial parcellation process. Further, the spatial expanse of an area constrains the computation of subsequent areas because no overlaps are allowed.
Applications in fMRI data
Here, we illustrate δMAPS on cortical restingstate fMRI data from a single subject (healthy young male adult, subjectID: 122620) from the WUMinn Human Connectome Project (HCP). Our goal is to illustrate that δMAPS is able to identify wellknown restingstate networks even from single subject data, without having to rely on grouplevel averages. The data acquisition parameters are described in (Smith et al. 2013). The spatial resolution is 2mm in each voxel^{Footnote 6} dimension. The preprocessing of fMRI data requires several steps; we use the “fixextended” HCP minimal processing pipeline; please see (Glasser et al. 2013). We also perform bandpass filtering in the range 0.010.08Hz, as commonly done in restingstate fMRI.
In this paper, we analyze two scanning runs of the same subject (“scan1” and “scan2”). Each scan lasts about 14 minutes and results in a time series of length T=1200 (repetition time TR=720msec). We emphasize that major differences across different scanning sessions of the same subject are common in fMRI; for this reason, most studies of functional brain networks often only report grouplevel averages. The entire cortical volume is projected to a surface mesh (Conte69 32K) resulting in about 65K grayordinate points (as opposed to volumetric voxels). Each point of this mesh is adjacent to six other points; for this reason, we set K=6. The homogeneity threshold is set to δ=0.37 (inferred using the heuristic proposed in (Fountalis et al. 2014)). The maximum lag range τ_{max} is set to ± 3, i.e., 2.2 seconds, and the FDR threshold is set to q= 10^{−4} (i.e., we expect on average one out of 10K edges to be a false positive).
The application of δMAPS results in a network with about 850 domains in scan1 (1120 domains in scan2). 80% of the domains are smaller than 3040 voxels (depending on the scan) and 5% of the domains are larger than 250 voxels (Fig. 6a, b shows the identified domains). The number of edges is 4285 in scan1 (4200 in scan2). The absolute value of the crosscorrelation associated with each edge is typically larger than 0.5. The fraction of negative edge correlations is about 5% in scan1 and 20% in scan2 suggesting that the polarity of some network edges may be timevarying. The lag τ^{∗} that corresponds to the maximum crosscorrelation is 0 in 70% of the edges and ± 1 in almost all other cases. 13% of the edges are directed, meaning that lag0 does not produce a significant correlation for that pair of domains. There is a positive correlation between the degree of a domain and its physical size (the correlation coefficient between degree and log10(size) is 0.70 for scan1 and 0.66 for scan2). Further, the network is assortative meaning that domains tend to connect to other domains of similar degree (assortativity coefficient about 0.7 in both scans).
An important question is whether the δMAPS networks are consistent with what neuroscientists currently know about restingstate activity in the brain. During rest, certain cortical regions that are collectively referred to as the DefaultMode Network (or DMN) are persistently active across age and gender (Yeo et al. 2011). Other known RestingState Networks (RSNs) are the occipital (part of the visual system) and the motor/somatosensory (associated with planning and execution of voluntary body motion). With the terminology of network theory, the previous “networks” would be referred to as communities within the larger functional brain network. To identify communities in the δMAPS network, we applied OSLOM (Lancichinetti et al. 2011). OSLOM identifies two hierarchical levels in both scans. The first level consists of highly overlapping communities that cover almost the entire cortex. The second hierarchical level is more interesting, resulting in eight communities for scan1 (nine for scan2). Figure 6e, f shows the three communities (C.1, C.2, C.3) for each scan that have the highest resemblance to the three previously mentioned restingstate networks: C.1 corresponds to the DMN, C.2 corresponds to the occipital restingstate network, and C.3 corresponds to the motor/somatosensory network. C.1 is quite similar across the two scanning sessions and it clearly captures the DMN. In C.2, the extent of the network is smaller in scan2, which is not too surprising giving the known interscan variability of restingstate fMRI. C.3 is also quite similar across the two scans and consistent with the motor/somatosensory network.
To further investigate the structure of those higher degree (and typically larger) domains, we perform kcore decomposition (AlvarezHamelin et al. 2006). The kcore decomposition process starts with the original network (k=0), and it removes iteratively all nodes of degree k or less in each round so that after the extraction of the k’th core all remaining nodes have degree larger than k. The density of the remaining network, as shown in Fig. 5, after the extraction of k=14 cores from the scan1 network (k=16 cores in scan2) shows a sudden increase by a factor of two. This suggests that the network includes a densely interconnected backbone. The size of this backbone is small relative to the entire network: 130 domains in scan1 (90 in scan2).
Similar observations about restingstate functional brain networks have been previously reported based on a richclub network analysis method (van den Heuvel and Sporns 2011). Fig. 6c, d shows the location of the backbone domains for each hemisphere and for each scan. The regions that are usually associated with the DMN dominate the backbone of both sessions. Interestingly though, scan1 includes the regions of the motor/somatosensory network, while the backbone of scan2 is missing those regions.
We conclude the analysis comparing our results to those obtained by ICA. ICA, in contrast to the proposed method, aims to identify temporally coherent components (ignoring the need for spatial contiguity). Here, we use MELODIC ICA (Beckmann and Smith 2004) to identify 7 independent components (ICs) for each scan^{Footnote 7}; here we only show the components that are more similar to the RNNs presented in Fig. 6e, f. The three ICs correspond to the DMN (I.C. 1), occipital (I.C. 2), and motor/somatosensory (I.C. 3) network. We also observe differences in terms of activation strength between the two scans. Interestingly, these differences are “reflected” in both methods. Compare for example the size of the identified communities in the occipital network to the strength of the activations in the corresponding IC. The similarity of results from two qualitatively different methods, encourages us to believe that δMAPS can identify meaningful functional components and infer their connectivity.
Discussion
In climate science future possible applications of δMAPS range from quantifying uncertainties in climate projections to diagnosing changes in teleconnections in response to anthropogenic perturbations. Furthermore δMAPS can be successfully applied towards quantifying differences across datasets and models, evaluating model performances, and investigating model biases and their propagation across different fields of the climate system. A more indepth discussion of these aspects and applications can be found in (Bracco et al. 2018).
δMAPS results in a correlationbased functional network. A next step would be to infer a causal, or effective network, leveraging the framework of probabilistic graphical models. For example, in (EbertUphoff and Deng 2014) the authors leverage probabilistic graphical models to construct a causal climate network using predefined climate indices. Instead of attempting to construct a graph in which the nodes are arbitrarily defined, one could leverage δMAPS to identify the underlying structure and then apply conditional independence tests to remove noncausal edges. Further, probabilistic graphical models always result in a directed acyclic graph (DAG). However, in many cases (e.g., climate) feedback loops exist, thus such a framework is not a realistic model for the system’s dynamics. Alternative approaches to establish causal inference could be based on Granger causality or controlled interventions (Hlinka et al. 2013; Holland et al. 1985).
Additionally, in many real systems the underlying temporal dynamics are nonstationary. Instead of relying on sliding windowbased approaches, which are often sensitive to the duration of the window, an important extension of δMAPS will be to construct dynamic networks by detecting automatically the time periods during which the network remains constant. It would also be interesting to combine the inferred functional network with a structural network that shows the physical connectivity between the identified domains. This is not hard in the case of communication networks but it becomes also feasible for brain networks using diffusionweighted MRI. The projection of the observed dynamics on the underlying structure can help to characterize the actual function and delay of each system component. Finally, here we assume that a universal threshold δ can be applied across the spatial extent of the spatiotemporal field. However, an alternative would be to apply different thresholds for different regions of the field.
Conclusions
In this paper we present δMAPS, a method suitable for the analysis of spatiotemporal data. At a first step, δ maps identifies “domains”; the functional components of a spatiotemporal system. δMAPS is based on the premise that the functional relation between the grid cells of a domain results in highly correlated temporal activity. To this end it first identifies the “epicenter” or “core” of a domain as a point (or set of points) where the local homogeneity is maximum across the entire domain. Instead of searching for the discrete boundary of a domain, which may not exist in reality, we compute a domain as the maximum possible set of spatially contiguous cells that include the detected core, and that satisfy a homogeneity constraint δ.
At a second step, δMAPS infers a functional network between domains. Different domains may have correlated activity, potentially at a lag, because of direct or indirect interactions. The proposed network inference method examines the statistical significance of each lagged crosscorrelation between two domains, applies a multipletesting process to control the rate of false positives, infers a range of potential lag values for each edge, and assigns a weight to each edge based on the covariance of the corresponding two domains.
Using δMAPS we analyzed the temporal relationships between different functional components of the climate system in the sea surface temperature field. We found that the proposed method successfully uncovered many wellknown climate teleconnections and the lag associated with them. In the context of neuroscience, we performed a single subject analysis focusing on resting state fMRI data. We found that the proposed method was able to uncover many of the wellknown resting state networks. We also show how the method identifies a small number of strongly interconnected areas forming the backbone of the resting state network. Finally, using synthetic data we also show how δMAPS overcomes limitations of traditional dimensionality reduction techniques such as PCA/ICA, clustering and overlapping community detection.
Appendix 1: Identifying the largest domain is NPcomplete
We are given a spatiotemporal field X(t) on a grid G, a pairwise similarity metric between pairs of grid cells and a threshold δ. Starting from a grid cell c, the goal is to find the largest subset of grid cells that form a single spatially connected component, and whose average similarity exceeds the threshold δ. The spatial grid can be represented as a planar graph G(V,E) where each grid cell is a node and edges connect adjacent grid cells. Formally we have the following graph optimization problem:
Definition 1. Rooted Largest Connected δDense Subgraph Problem (rooted LC δDS). Given a regular (grid) graph G(V,E), a weight function \(w: V\times V \rightarrow \mathbb {R}\) (where w(v,v)=0 and symmetric), a threshold δ, and a node c∈V, find a maximum cardinality set of nodes A⊆V such that c∈A, the induced subgraph is connected (I_{G}(A)=1) and \(\frac {\sum _{v,u\in A}w(v,u)}{A(A1)} > \delta \) (i.e., \(\hat {r}(A) > \delta \)).
To show that rooted LC δDS is NPhard we first consider a variant of the problem in which the induced subgraph A has to satisfy two conditions; it has to be a connected subgraph of G, and the average weight of the edges in A has to exceed δ. More formally:
Definition 2. Largest Connected δDense Subgraph Problem (LC δDS). Given a regular (grid) graph G(V,E), a weight function \(w: V\times V \rightarrow \mathbb {R}\) (where w(v,v)=0 and symmetric), and a threshold δ, find a maximum cardinality set of nodes A⊆V such that I_{G}(A)=1 and \(\hat {r}(A) > \delta \).
To show that LC δDS is NPhard we use a reduction of the densest connected k subgraph problem.
Definition 3. Densest Connected kSubgraph Problem (DCkS). Decision version: Given a graph G(V,E), and positive integers k and j, does there exist an induced subgraph on k vertices such that this subgraph has at least j edges and is connected?
DCkS (also referred to as the connected hclustering problem) has been shown to be NPcomplete on general graphs (Corneil and Perl 1984), as well as on planar graphs (Keil and Brecht 1991). DCkS is polynomially time solvable for subclasses of planar graphs of bounded tree width (Arnborg and Seese 1991). Grid graphs, which are the type of graphs that arise in our application domains, are planar bipartite graphs, with nonfixed tree width, and no positive results are known for this subclass of planar graphs. The work on approximating densest/heaviest connected ksubgraphs is relatively very limited (see recent theoretical result (Chen et al. 2015)). It is easy to show that the DCkS problem can be easily reduced to an instance of the decision version of the LC δDS problem, and hence it is also NPcomplete even on planar graphs.
LEMMA 1. The decision version of the LC δDS problem is NPcomplete on planar graphs.
PROOF. This can be shown via a reduction from the DCkS. We reduce an instance <G,k,j> of the DCkS to an LC δDS instance by using the same graph G, setting w(u,v)=I(u,v)∈E (w(u,v) is 1 if and only if the pair of nodes is connected by an edge), and δ=j/k(k−1).
Now it is easy to show that rooted LC δDS is also NPhard. If a polytime algorithm existed for the rooted LC δDS, then by calling it V times with each of the nodes of the graph, we would obtain in polytime a solution to the NPhard LC δDS.
Appendix 2: δMAPS pseudocode
Notes
 1.
This formula assumes that the pvalues are independent (which is often not true in practice). The case of correlated pvalues can be handled replacing q qith \(q/\sum _{i=1}^{m} 1/i\), but that approach is very conservative, resulting in many false negatives (Reiner et al. 2003).
 2.
An analytic approach based on extremevalue statistics was proposed in (Kramer et al. 2009) but it relies on several approximations. Numerical approaches based on frequencydomain bootstrapping, on the other hand, are computationally expensive (Kramer et al. 2009; Martin and Davidsen 2014; Rummel et al. 2010).
 3.
In principle, it may be a set of lag values. In practice though, significant correlations result for a continuous range of lag values.
 4.
We have experimented with other pruning thresholds between 20%50% and the results are very similar at the first two hierarchy levels.
 5.
For instance, if two friends are both enemies with a third person, they form a balanced social triangle.
 6.
Grid cells are referred to as voxels in the fMRI literature.
 7.
MELODIC ICA has an option to automatically estimate the number of ICs to return. Choosing this option yielded approximately 200−250 components in each scan. Activations were much lower than the ones shown in Fig. 6g, h both in strength and spatial extent. We could not identify RSNs similar to those shown here.
Abbreviations
 DAG:

Directed Acyclic Graph
 DCkS:

Densest Connected kSubgraph Problem
 DMN:

Default Mode Network
 ENSO:

El Ni\(\tilde {n}\)
 EOF:

Empirical Orthogonal Functions
 FDR:

False Discovery Rate
 fMRI:

Functional Magnetic Resonance Imaging
 HCP:

Cumman Connectome Project
 ICA:

Independent Component Analysis
 LC δDS:

Largest Connected δDense Subgraph Problem
 PCA:

Principal Component Analysis
 RSN:

Resting State Network
 SST:

Sea Surface Temperature
References
Ahn, YY, Bagrow JP, Lehmann S (2010) Link communities reveal multiscale complexity in networks. Nature 466(7307):761–764.
AlvarezHamelin, JI, Dall’Asta L, Barrat A, Vespignani A (2006) Large scale networks fingerprinting and visualization using the kcore decomposition. NIPS:41–50.
Arnborg, S, Seese JLD (1991) Easy problems for treedecomposable graphs. J Algoritm 12(2):308–340.
Baldassano, C, Beck DM, FeiFei L (2015) Parcellating connectivity in spatial maps. PeerJ 3:784.
Barimalala, R, Bracco A, Kucharski F (2012) The representation of the south tropical atlantic teleconnection to the indian ocean in the ar4 coupled models. Climate Dyn 38:1147–1166.
Beckmann, CF, Smith SM (2004) Probabilistic independent component analysis for functional magnetic resonance imaging. IEEE Trans Med Imaging 23(2):137–152.
Benjamini, Y, Hochberg Y (1995) Controlling the false discovery rate: A practical and powerful approach to multiple testing. J R Stat Soc Series B:289–300.
Blumensath, T, Behrens TE, Smith SM (2012) Restingstate fmri single subject cortical parcellation based on region growing. MICCAI 2012:188–195.
Blumensath, T, Jbabdi S, Glasser MF, Essen DCV, Ugurbil K, Behrens TE, Smith SM (2013) Spatially constrained hierarchical parcellation of the brain with restingstate fmri. Neuroimage 76:313–324.
Box, GE, Jenkins GM, Reinsel GC (2011) Time series analysis: forecasting and control. Wiley, United States.
Bracco, A, Falasca F, Nenes A, Fountalis I, Dovrolis C (2018) Advancing climate science with knowledgediscovery through data mining. npj Clim Atmos Sci 1(1).
Chen, X, Hu X, Wang C (2015) Finding connected dense ksubgraphs. Theory and Applications of Models of Computation:248–259.
Corneil, DG, Perl Y (1984) Clustering and domination in perfect graphs. Discret Appl Math 9(1):27–39.
Craddock, RC, James GA, Holtzheimer PE, Hu X, Mayberg HS (2012) A whole brain fmri atlas generated via spatially constrained spectral clustering. Hum Brain Mapp 33(8):1914–1928.
Dommenget, D, Latif M (2002) A cautionary note on the interpretation of eofs. J Clim 15(2):216–225.
Donges, JF, Zo Y, Marwan N, Kurths J (2009) The backbone of the climate network. EPL 87(4):48007.
Easley, D, Kleinberg J (2010) Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press, United Kingdom.
EbertUphoff, I, Deng Y (2014) Causal discovery from spatiotemporal data with applications to climate science. ICMLA:606–613.
Fountalis, I, Bracco A, Dovrolis C (2014) Spatiotemporal network analysis for studying climate patterns. Climate Dynam 42(34):879–899.
Fountalis, I, Dovrolis C, Dilkina B, Keilholz S (2017) deltamaps: From fmri data to functional brain networks. International Workshop on Complex Networks and their Applications:1237–1244.
Glasser, MF, Sotiropoulos SN, Wilson JA, Coalson TS, Fischl B, Andersson JL, Xu J, Jbabdi S, Webster M, Polimeni JR, et al. (2013) The minimal preprocessing pipelines for the human connectome project. Neuroimage 80:105–124.
Heuvel, MVD, Mandl R, Pol HH (2008) Normalized cut group clustering of restingstate fmri data. PloS ONE 3(4):2001.
Hlinka, J, Hartman D, Vejmelka M, Runge J, Marwan N, Kurths J, Palus M (2013) Reliability of inference of directed climate networks using conditional mutual information. Entropy 15(6):2023–2045.
Holland, PW, Glymour C, Granger C (1985) Statistics and causal inference. ETS Research Report Series 2:945–960.
Hyvärinen, A (1999) Fast and robust fixedpoint algorithms for independent component analysis. IEEE Trans Neural Netw 10(3):626–634.
Kawale, J, Liess S, Kumar A, Steinbach M, Snyder P, Kumar V, Ganguly AR, Samatova NF, Semazzi F (2013) A graphbased approach to find teleconnections in climate data. Stat Anal Data Min 6(3):158–179.
Keil, JM, Brecht JTB (1991) The complexity of clustering in planar graphs. J Comb Math Comb Comput 9:155–159.
Klein, SA, Soden BJ, Lau NC (1999) Remote sea surface temperature variations during enso: Evidence for a tropical atmospheric bridge. J Climate 12(4):917–932.
Kramer, MA, Eden UT, Cash SS, Kolaczyk ED (2009) Network inference with confidence from multivariate time series. Phys Rev E 79(6):061916.
Lancichinetti, A, Radicchi F, Fortunato SJJR (2011) Finding statistically significant communities in networks. PloS ONE 6(4):18961.
Lu, Y, Jiang T, Zang Y (2003) Region growing method for the analysis of functional mri data. NeuroImage 20(1):455–465.
Martin, E, Davidsen J (2014) Estimating time delays for constructing dynamical networks. Nonlinear Proc Geoph 21(5):929–937.
McGuire, MP, Nguyen NP (2014) Community structure analysis in big climate data. IEEE Int Conf Big Data:38–46.
Palla, G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814–818.
Pnevmatikakis, EA, Soudry D, Gao Y, Machado TA, Merel J, Pfau D, et al. (2016) Simultaneous denoising, deconvolution, and demixing of calcium imaging data. Neuron 89(2):285–299.
Power, JD, Cohen AL, Nelson SM, Wig GS, Barnes KA, Church JA, Vogel AC, Laumann TO, Miezin FM, Schlaggar BL, et al. (2011) Functional network organization of the human brain. Neuron 72(4):665–678.
Reiner, A, Yekutieli D, Benjamini Y (2003) Identifying differentially expressed genes using false discovery rate controlling procedures. Bioinformatics 19:368–375.
Rayner, N, Parker DE, Horton E, Folland C, Alexander L, Rowell D, Kent E, Kaplan A (2003) Global analyses of sea surface temperature, sea ice, and night marine air temperature since the late nineteenth century. J Geophys Res Atmospheres 108(D14):1984–2012.
RodríguezFonseca, B, Polo I, GarcíaSerrano J, Losada T, Mohino E, Mechoso CR, Kucharski F (2009) Are Atlantic Niños enhancing Pacific ENSO events in recent decades?Geophys Res Lett 36(20).
Rummel, C, Müller M, Baier G, Amor F, Schindler K (2010) Analyzing spatiotemporal patterns of genuine crosscorrelations. J Neurosci Methods 191(1):94–100.
Simmons, AJ, Wallace J, Branstator GW (1983) Barotropic wave propagation and instability, and atmospheric teleconnection patterns. J Atmos Sci 40(6):1363–1392.
Smith, SM, Beckmann CF, Andersson J, Auerbach EJ, Bijsterbosch J, Douaud G, Duff E, Feinberg DA, Griffanti L, Harms MP, et al. (2013) Restingstate fmri in the human connectome project. Neuroimage 80:144–168.
Steinhaeuser, K, Chawla NV, Ganguly AR (2010) An exploration of climate data using complex networks. ACM SIGKDD Explorations Newsletter 12(1):25–32.
Steinhaeuser, K, Chawla NV, Ganguly AR (2011) Complex networks as a unified framework for descriptive analysis and predictive modeling in climate science. Stat Anal Data Min 4(5):497–511.
Steinbach, M, Tan PN, Kumar V, Klooster S, Potter C (2003) Discovery of climate indices using clustering. SIGKDD, ACM.
Storch, HV, Zwiers FW (2001) Statistical analysis in climate research. Cambridge University Press, United Kingdom.
Thirion, B, Varoquaux G, Dohmatob E, Poline JB (2014) Which fmri clustering gives good brain parcellations?Data Front Neurosci 8:167.
van den Heuvel, MP, Sporns O (2011) Richclub organization of the human connectome. J Neurosci 31(44):15775–15786.
Vejmelka, M, Pokorna L, Hlinka J, Hartman D, Jajcay N, Palus M (2015) Nonrandom correlation structures and dimensionality reduction in multivariate climate data. Clim Dynam 44(910):2663–2682.
Yeo, BT, Krienen FM, Sepulcre J, Sabuncu MR, Lashkari D, Hollinshead M, et al (2011) The organization of the human cerebral cortex estimated by intrinsic functional connectivity. J Neurophysiol 106(3):1125–1165.
Acknowledgments
The authors want to thank the anonymous reviewers for their comments that greatly improved the manuscript.
Funding
δMAPS development was supported by the Department of Energy through grant DESC0007143, and by the National Science Foundation (grant DMS1049095).
Author information
Affiliations
Contributions
The deltaMAPS method and the comparisons with other methods were developed by IF, CD and BD. The software implementation and all computational experiments were conducted by IF. The NPcompleteness proof was contributed by BD and IF. The application of deltaMAPS in climate science was performed by AB, IF and CD. The application of deltaMAPS in neuroscience was performed by SK, IF and CD. IF, CD, AB, and BD contributed in writing the manuscript. All authors read and approved the final manuscript.
Corresponding author
Correspondence to Ilias Fountalis.
Ethics declarations
Competing interests
The authors declare no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Additional information
Availability of data and materials
The fMRI data used in this paper are freely available from http://www.humanconnectome.org/. The climate data used in this paper are freely available from http://www.metoffice.gov.uk/hadobs/hadisst/. δMAPS source code can be obtained from https://github.com/FabriFalasca/deltaMAPS(δMAPS adapted for climate data) and https://github.com/deltaMAPS/deltaMAPS_fMRI(δMAPS adapted for fMRI data).
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Fountalis, I., Dovrolis, C., Bracco, A. et al. δMAPS: from spatiotemporal data to a weighted and lagged network between functional domains. Appl Netw Sci 3, 21 (2018) doi:10.1007/s411090180078z
Received
Accepted
Published
DOI
Keywords
 Dimensionality reduction
 Parcellation
 Network inference
 Climate teleconnections
 Functional brain networks