Connectome Smoothing via Lowrank Approximations
Abstract
In statistical connectomics, the quantitative study of brain networks, estimating the mean of a population of graphs based on a sample is a core problem. Often, this problem is especially difficult because the sample or cohort size is relatively small, sometimes even a single subject.
While using the elementwise sample mean of the adjacency matrices is a common approach, this method does not exploit any underlying structural properties of the graphs.
We propose using a lowrank method which incorporates tools for dimension selection and diagonal augmentation to smooth the estimates and improve performance over the naïve methodology for small sample sizes.
Theoretical results for the stochastic blockmodel show that this method offers major improvements when there are many vertices.
Similarly, we demonstrate that the lowrank methods outperform the standard sample mean for a variety of independent edge distributions as well as human connectome data derived from magnetic resonance imaging, especially when sample sizes are small.
Moreover, the lowrank methods yield “eigenconnectomes”, which correlate with the lobestructure of the human brain and superstructures of the mouse brain.
These results indicate that lowrank methods are an important part of the tool box for researchers studying populations of graphs in general, and statistical connectomics in particular.
Keywords: networks, connectome, lowrank, estimation
1 Department of Applied Math & Statistics, The Johns Hopkins University, Baltimore, MD
2 Department of Biomedical Engineering, The Johns Hopkins University, Baltimore, MD
3 Department of Radiology, and Department of Biomedical Engineering, Duke University, Durham, NC
4 Max Planck Research Group for Neuroanatomy & Connectivity, Max Planck Institute for Human Cognitive and Brain Sciences, Leipzig, Germany;
4 Child Mind Institute, New York, NY
5 Department of Mathematics & Statistics, Boston University, Boston, MA
* sussman@bu.edu
1 Introduction
Estimation of the mean of a population based on samples is at the core of statistics. The sample mean, motivated by its intuitive appeal, the law of large numbers, and the central limit theorem, has its place as one of the most important statistics for this task. In modern settings, averages of many different kinds of data representations are taken, including scalars and vectors, but also objects like images, shapes, and documents. In this manuscript we consider the challenges of estimating a population mean based on a sample of brain networks, as represented by their structural connectomes.
The mean of a population of graphs is a highdimensional object, consisting of parameters for graphs with nodes (vertices). When the number of samples is much smaller than , or even , estimating such a highdimensional estimands using naive unbiased methods can lead to inaccurate estimates with very high variance. Furthermore, using these estimates for subsequent inference tasks such as testing can lead to low power and accuracy. By exploiting a biasvariance tradeoff, it is often fruitful to develop estimators which have some bias but greatly reduced variance. When these estimators are biased towards lowdimensional structures which well approximate the full dimensional population mean, major improvements in estimation can be realized (Trunk, 1979). Furthermore, a more parsimonious representation of the mean improves interpretability and allows for further exploratory analysis.
In complex data settings such as shape data, language data, or graph data, caution is necessary even in properly defining the mean. For a population, we define the mean graph as the weighted adjacency matrix with weights given by the proportion of times the corresponding edge appears in the population. This definition naturally extends the definition of the mean for standard Euclidean data. As with real valued data, one may want to define the mean of a population of graphs to be a graph. This is captured in the notion of the median graph (Jiang et al., 2001). However, this may be too restrictive for populations of graphs where there is high variation. As described below, our definition of the mean graph is the expectation of the adjacency matrix.
The population mean is becoming an important object for statistical connectomics applications. For example, Ginestet et al. (2014) proposed a way to test if there is a difference between the distributions for two groups of networks. While hypothesis testing is the end goal of their work, estimation is a key intermediate step which may be improved by accounting for underlying structure in the mean matrix. Thus, improving the estimation procedures for the mean graph is not only important by itself, but also can be applied to help improve other statistical inference procedures.
To better illustrate the idea, consider brain graphs (connectomes) available through the Consortium for Reliability and Reproducibility (CoRR) (Zuo et al., 2014) after processing with ndmg pipeline (Kiar et al., 2017, 2016). In particular, the SWU4 dataset contains 454 brain scans (Qiu et al., 2017). Each vertex in the estimated graphs represents a region defined by the Desikan atlases, while an edge exists between two vertices if there is at least one streamline connecting the corresponding regions of the brain. More details about this dataset are given in Section 4.2 and Section A.4. Our goal is to estimate the mean graph of the population , defined as the entrywise mean of all the 454 graphs. Fig. 1 shows the population mean graph on the left panel. Darker pixels indicate a higher proportion of graphs having an edge between the given vertices.
The entrywise sample mean is a reasonable estimator if it is assumed that each edge is present independently of all other edges without taking any additional structure into account. However, with only a small sample size, the entrywise sample mean does not perform very well. Fig. 1(b) depicts the entrywise sample mean when the sample size is in the SWU4 dataset example. While gives a reasonable estimate of , there are still some node pairs with very inaccurate estimates. The upper triangular area of the heat map for depicts the 18 vertexpairs which have an absolute estimation error larger than . When the sample size is small, the performance of degrades due to its high variance. Such phenomena are most obvious when the sample size decreases from to . Fig. 1(c) shows the heat map of based on sample size . Since there is only one observed graph, is binary and thus very bumpy. Similarly, when the same absolute estimation error threshold is , 504 (out of 2415) edges in the upper triangular area are highlighted.
Intuitively, an estimator incorporating known structure in the true distribution of the graphs, assuming the estimator is computationally tractable, is preferable to the entrywise sample mean. We propose an estimator based on a lowrank structure of a family of random graphs. Section 3.3 discusses details about this estimator. These estimates improve the performance since they have much lower overall variance than naive entrywise sample means, thereby offsetting the bias towards the lowrank structure in terms of overall error.
When we use the same random sample size of is in Fig. 1, the plot of lowrank estimate in Panel (e) shows a finer gradient of values which leads, in this case, to a 3% relative improvement in estimation of the true probability matrix, ( with mean squared error equal to and with mean squared error equal to ). The upper triangular area of the heat map for depicts the 6 edges which have absolute estimation error larger than , whereas 18 edges are highlighted for based on the same threshold.
The smoothing effect is much more obvious when sample size is decreased from to , as in Fig.1(f). smooths the estimate, especially for edges across the two hemispheres, in the lower left and corresponding upper right block (which is not shown in the heat map). Based on the calculations, (with mean squared error equals ) outperforms (with mean squared error equals ), with a 53% relative improvement in estimation. Similarly, the same absolute estimation error threshold of highlights 234 edges for , less than as many as .
In addition to potentially improving the overall accuracy of the estimate of the mean graph, lowrank methods also produce parsimonious and interpretable representations of the data as represented by the random dot product graph model parameters. As demonstrated later, the interpretations of these model parameters illustrate hypotheses which relate the structure of the connectome to well established anatomical structures (see Fig. 2 and Section 4.5) and suggest a basis for mapping structural hierarchies in brain organization.
2 Statistical Connectome Models
This work considers the scenario of having graphs, represented as adjacency matrices, , each having vertices with for each . We assume there is a known correspondence for vertices in different graphs, so that vertex in graph corresponds to vertex in graph for any , , . The graphs we consider are undirected and unweighted with no selfloops, so each is a binary symmetric matrix with zeros along the diagonal.
In connectomics, the brain imaging data for each subject can be processed to output a graph, where each vertex represents a welldefined anatomical region present in each subject. For structural brain imaging, such as diffusion tensor MRI, an edge may represent the presence of anatomical connections between the two regions as estimated based on tractography for diffusion tensor magnetic resonance imaging (Gray et al., 2012). Similarly, for functional brain imaging, such as fMRI, an edge between two regions may represent the presence of correlated brain activity between the two regions.
For the purpose of this paper, we assume that the graphs are sampled independently and identically from some distribution. To this end, the mean graph is the expectation of each adjacency matrix.
Definition 2.1 (Mean Graph).
Suppose that for some random graph distribution , with for each . The mean graph is defined as , where the graphs are identically distributed for any .
2.1 Independent Edge Model
The most general model we consider is the independent edge model (IEM) with parameter (Bollobás et al., 2007). An edge exists between vertex and vertex with probability , and each edge is present independently of all other edges. Note that the IEM is a generalization of the ErdősRényi random graphs, where each edge is present with probability independently of all other edges (Gilbert, 1959; Erdős and Rényi, 1959). For this case, the mean graph is .
2.2 Random Dot Product Graph
In graphs, the adjacencies between vertices generally depend on unobserved properties of the corresponding vertices. For example, in a connectomics setting, two brain regions with similar properties might have similar connectivity patterns. The latent positions model (LPM) proposed by (Hoff et al., 2002) captures such structure, where each vertex is associated with a latent position that influences the adjacencies for that vertex. In this model, each vertex has an associated latent vector . Conditioned on the latent positions, the existence of each edge is independent and the probability the edge is present only depends on the latent vectors of the incident vertices through a link function. If is much smaller than the number of vertices and the link function is known, LPMs are more parsimonious models compared to IEM, requiring only parameters rather than .
A specific instance of an LPM examined in this work is the random dot product graph model (RDPG) (Young and Scheinerman, 2007; Nickel, 2008) where the link function is the dot product, so the probability of an edge being present between two nodes is the dot product of their latent vectors. The latent position is determined by properties of that vertex, and vertices whose latent positions are close are more likely to have an edge between them than vertices whose latent positions are far from each other.
Formally, let be a set such that implies . Let be column vectors representing the latent positions and let . A random graph with random adjacency matrix is said to be an RDPG if for each adjacency matrix ,
In the RDPG model, each vertex is associated with latent position , and conditioned on the latent positions , the entries are distributed independently as for . Note that the probability matrix is the outer product of the latent position matrix with itself, . This imposes two properties on , namely that is positivesemidefinite and . These properties lead us to our proposed estimator. Importantly, even if is positive semidefinite and lowrank will always be indefinite, since it has a zero diagonal, and will with high probability have full rank.
In the RDPG model, by representing a lowrank matrix in terms of the latent positions, where each vertex is represented as a vector in and the entries of the matrix are given by the inner products of these vectors, we can analyze and visualize the geometry of these vectors to interpret how each vertex is behaving in the context of the larger graph. By using the SWU4 brain graphs again as an example (see Section 4.2 and A.4) and embedding the mean graph , the average of all 454 graphs, we determined the estimated latent positions , where is the number of vertices and is the dimension selected by the Zhu and Ghodsi’s method (Zhu and Ghodsi, 2006).
Fig. 2 shows the first 4 dimensions of in the brain. The value of determines the color of the th brain region for the th dimension; i.e. the th element of the estimated latent vector for the th region. Red represents a positive value while blue represents the negative one, and the darker the color, the smaller the magnitude of the .
The 1st dimension, depicted in Panel (a) of the figure, shows the average level of connectivity for each vertex. Panel (b) shows a distinction between the left and right hemisphere, as conveyed in the 2nd dimension. Similarly, the other dimensions qualitatively correspond to different lobes. For example, the red color corresponds to the Frontal and Temporal lobes in the 3rd dimension, while the light blue roughly matches the Occipital lobe in the 4th dimension.
These “eigenconnectomes” demonstrate noteworthy similarity to the structural connectome harmonics of Atasoy et al. (2016). While prior work has established the utility of eigenconnectomes as a basis set for modeling of functional dynamics, the current study demonstrates the correspondence of these dimensions with lobular divisions. Future work integrating the connections between structural features with the modeling of dynamics may provide insight into the spatial distribution of largescale cortical hierarchies (Margulies et al., 2016). Additionally, such representations allow the use of techniques from multivariate analysis to further study the estimated population mean.
The connection between eigenvectors corresponding to each dimension and lobes will be explored more rigorously in Section 4.5.




2.3 Stochastic Blockmodel as an RDPG
One of the most common structures for graphs is that vertices tend to cluster into communities such that vertices of the same community behave similarly, connecting to similar sets of nodes. This structural property is captured by the stochastic blockmodel (SBM) (Holland et al., 1983), where each vertex is assigned to a block and the probability that an edge exists between two vertices depends only on their respective block memberships.
The SBM is parameterized by the number of blocks (generally much less than the number of vertices ), the block probability matrix , and the vector of block memberships , where for each , means vertex is a member of block .
Conditioned on , each entry of the adjacency matrix () is independently sampled from the Bernoulli distribution with parameter . To ensure that the SBM can be considered as an RDPG, we impose that the matrix for the SBM is positive semidefinite. For notational convenience the submodel of the SBM with positive semidefinite matrix is referred to as simply the SBM.
To analyze the estimator motivated by RDPG (Section 3.3 discusses how to construct ), the SBM can be viewed as an RDPG by decomposing as , where with rows given by and each row is the shared latent position for all vertices assigned to block . Let have rows given by . Since and represent the blocks that vertex and vertex belong to respectively:
The SBM is therefore a special case of an RDPG where all vertices in the same block have identical latent positions.
An example SBM is illustrated in Fig. 3. We consider a 5block SBM and plot the corresponding probability matrix and one adjacency matrix generated from it with 200 vertices. Panel (a) shows the blockconstant structure of the probability matrix and panel (b) shows how this structure is reflected in the random binary adjacency matrix.
Remark 2.2.
Rather than allowing vertices to differ from each other as in the RDPG, the SBM presumes all nodes within the same block have the same expected degree. Vertices in the same block are all stochastically equivalent. To better describe complex network structures, many generalizations of the SBM have been explored to incorporate the local variation of vertices to the block structure. Airoldi et al. (2008) proposed mixed membership stochastic blockmodels, which associates each vertex with multiple blocks with a probability vector rather than a single block as SBM requires. To model variation of the expected degrees of different vertices within the same block, Karrer and Newman (2011) proposed degreecorrected SBM, which assigns additional parameters to each vertex to adjust the expected degree relatively. These generalizations aim to capture variations among vertices while maintaining aspects of the original community structure. The RDPG is useful in this regard since any positive semidefinite SBM with degreecorrection and mixed membership can be represented as an RDPG and visa versa.
3 Estimators
3.1 Decision Theory
Estimating the mean of a population of samples requires a procedure. In statistical decision theory, the risk of a procedure for a given parameter value , , is defined as the expected loss. The loss function can be squared Euclidean distance, absolute distance, or other distances (Bickel and Doksum, 2007) and the expectation is taken with respect to the given parameter. A procedure dominates another procedure if the risk of is no bigger than the risk of regardless of the parameter, and strictly less than the risk of in some situations.
In a striking result, Stein (1956) and James and Stein (1961) showed that even the arithmetic mean can be dominated by another procedure. In particular, James and Stein showed that the sample mean for a multivariate normal distribution with at least three dimensions has strictly higher risk than a procedure that introduces shrinkage, and can be strictly improved by carefully biasing the estimate towards any given fixed point. Twentyseven years later, Gutmann (1982) proved that this phenomenon cannot occur when the sample spaces are finite, as is the case for graphs. However, while there must be some cases where the sample mean is preferred, this does not imply that other estimators should not be considered. In many situations where other structural information is hypothesized, other estimators may be preferable.
3.2 Elementwise sample mean
The most natural estimator to consider is the elementwise sample mean. This estimator, defined as , is the maximum likelihood estimator (MLE) for the mean graph if the graphs are sampled from an IEM distribution. It is unbiased so with entrywise variance . Moreover, for the independent edge model, is the uniformly minimumvariance unbiased estimator, so it has the smallest variance among all unbiased estimators. Similarly, it enjoys the many asymptotic properties of the MLE as for fixed . However, if graphs with a large number of vertices are of interest, is not consistent for as the number of vertices becomes large for fixed , while our estimator discussed in Section 3.3 is consistent for lowrank .
Additionally, does not exploit any underlying graph structure. If the graphs are distributed according to an RDPG or SBM, then is no longer the maximum likelihood estimator since it is not guaranteed to satisfy the properties of the mean graph for that model. The performance can be especially poor when the sample size is small, such as when . For example, when , is simply the binary adjacency matrix , which is an inaccurate estimate for an arbitrary compared to estimates which exploit underlying structure, such as the lowrank structure of the RDPG model.
3.3 LowRank Estimator
Motivated by the lowrank structure of the RDPG mean matrix, we propose the estimator based on the spectral decomposition of which yields a low rank approximation of . This estimator does not estimate the parameters of a stochastic blockmodel, as we wish to allow for the increased flexibility of the RDPG. However this can be implemented as a step towards estimating SBM parameters.
This estimator is similar to the estimator proposed by Chatterjee (2015) but incorporates additional adjustments which serve to improve the performance for the specific task of estimating the mean graph. Additionally, we consider an alternative dimension selection technique. Details of the dimension selection procedures and the diagonal augmentation are in Section A.2 and A.3, respectively. To summarize, the overall strategy to compute is described in Algorithm 1. A key component of this algorithm is the lowrank approximation (see Algorithm 2 for details).
The first step is to calculate the sample mean . In Step 2 to Step 4, the algorithm augments the diagonal of based on Marchette et al. (2011), selects the dimension to embed (see Section A.2), and computes the lowrank approximation based on the embedding. Then in Step 5 and Step 6, the algorithm augments the diagonal again based on (Scheinerman and Tucker, 2010) (see Section A.3) which yields an improved lowrank estimate . Finally, Step 7 thresholds the matrix entries to ensure all elements are between 0 and 1.
For a given dimension we consider the estimator defined as the best rank positivesemidefinite approximation of . Let be a diagonal matrix with nonincreasing entries along the diagonal corresponding to the largest eigenvalues of and let have columns given by the corresponding eigenvectors. Similarly, let be the diagonal matrix with nonincreasing entries along the diagonal corresponding to the rest eigenvalues of and let have columns given by the corresponding eigenvectors. Since the graphs are symmetric, the eigendecomposition can be computed as as . The dimensional adjacency spectral embedding (ASE) of is given by . For an RDPG, the rows of are estimates of the latent vectors for each vertex (Sussman et al., 2014). Using the adjacency spectral embedding, the lowrank approximation is to be . Algorithm 2 in the appendix gives the steps to compute this lowrank approximation for a general symmetric matrix .
To compute the estimator , the rank must be specified; there are various ways of dealing with dimension selection. In this paper, we explore an elbow selection method proposed in Zhu and Ghodsi (2006) and the universal singular value thresholding (USVT) method (Chatterjee, 2015). Section A.2 discusses details of these methods.
Moreover, since the adjacency matrices are hollow, with zeros along the diagonal, there is a missing data problem that leads to inaccuracies if is computed based only on . To compensate for this issue, we use an iterative method developed in Scheinerman and Tucker (2010). Section A.3 discusses details of the iterative method.
Algorithm 1 gives the steps involved to compute the lowrank estimate . The bottom panels of Fig. 3 demonstrate the two estimators and for the stochastic blockmodel given by Panel (a). The estimates are based on a sample of size and in this instance visual inspection demonstrates that performs much better than . As in the succeeding sections, this procedure will frequently yield improvements in estimation as compared to using the sample mean . While this is not surprising for random dot product graphs, where we are able to show theoretical results to this effect, we also see this effect for connectome data and more general independent edge graphs. In the following sections, this estimator is explored in the context of the stochastic blockmodel.
4 Statistical Efficiency under Low Rank Models
4.1 Theoretical Results
To estimate the mean of a collection of graphs, we consider the two estimators from Section 3: the entrywise sample mean and the lowrank motivated by the RDPG. We first evaluated the mean squared error for our estimators, and . While one can directly compare the difference in mean squared errors between the two estimators, it is frequently useful to consider the relative efficiency between two estimators. In our case, this is , with values above 1 indicating should be preferred while values below 1 indicate should be preferred. Relative efficiency is a useful metric for comparing estimators because it will frequently be invariant to the scale of the noise in the problem and hence is more easily comparable across different settings.
In this section, entrywise relative efficiency is computed to analyze the performance of these two estimators under the SBM. The asymptotic relative efficiency is also evaluated. The asymptotic relative efficiency is the limit of the relative efficiency as the number of vertices but with the number of graphs fixed, and the scaled relative efficiency, which normalizes the relative efficiency so that the asymptotic scaled relative efficiency is nonzero and finite. Somewhat surprisingly, the data show that the asymptotic relative efficiency will not depend on this fixed sample size .
For this asymptotic framework, we assume the block memberships are drawn iid from a categorical distribution with block membership probabilities given by . In particular, this implies that for each block , the proportion of vertices in block , , will converge to as by the law of large numbers. We will also assume that for a given , the block membership probabilities are fixed for all graphs. Denote the block probability matrix as . By definition, the mean of the collection of graphs generated from this SBM is , where . After observing graphs on vertices sampled independently from the SBM conditioned on , the two estimators can be calculated, and .
Lemma 4.1.
For the above setting, for any , if ; for large enough ,
and
The first part of this lemma ensures that the estimator is asymptotically unbiased for , and the second part gives the form of the asymptotic variance of . Note that represents the probability that a vertex is assigned to the same block as vertex , i.e. th block. The proof of this lemma is outlined in Section A.5 and is based on results for the variance of the adjacency spectral embedding from Athreya et al. (2016). Lemma 4.1 shows that the MSE of has order in terms of and , regardless of the SBM parameters. Similar to , the estimate will get better as the number of observations increases. However, it also benefits from more vertices since the number of parameters for a lowrank grows slowly compared to the number of potential edges as the number of vertices increases. That is, will perform better as the number of vertices increases.
Moreover, since is the sample mean of independent Bernoulli random variables with parameter , then
Based on this MSE result of and the MSE result of given by Lemma 4.1, the next theorem follows.
Theorem 4.2.
In the same setting as in Lemma 4.1, for any , if , then for large enough :
(1) 
And the asymptotic relative efficiency (ARE) is
Proof.
Combining the MSE result of
and Lemma 4.1, i.e. for large enough ,
and therefore there is a large enough ,
And the ARE result follows directly by taking the limit of RE as . ∎
This theorem indicates that under the SBM, is a much better estimate of the mean of the collection of graphs than , especially when is large. Note that a relative efficiency less than 1 indicates that should be preferred over , so under the above assumptions, as , performs far better than . Note that even though the RE could be greater than for some , eventually the RE will go to 0 as increases. The result shows that the relative efficiency is of order and (which is denoted as scaled RE) converges to when . An important aspect of Theorem 4.2 is that the ARE does not depend on the number of graphs , so the larger the graphs are, the better is relative to , regardless of .
Note that the asymptotic result here is for a number of vertices going to infinity with a fixed number of graphs. This setting will be very useful in connectomics analysis, especially as the collection of larger and larger brain networks grow from initially small sample sizes as the technology to scale these connectome collection techniques is developed. For example, Calabrese et al. (2015) recently reported a high resolution magnetic resonance microscopy based estimate of the mouse brain using a single mouse.
The approximate formula Eq. 1 indicates that the sizes of the blocks can greatly impact the relative efficiency. As an example, consider a 2block SBM. If each of the blocks contain half the vertices, then for each pair of vertices, the relative efficiency is approximately . If the first block gets larger, with , then the RE for estimating with will tend to its minimum of . On the other hand as , if and , then, since , the relative efficiency for estimating such an edge pair will be approximately and the same will hold if . Note that the maximum value for the relative efficiency of two vertices from different blocks in a twoblock model is achieved when and in which case the relative efficiency is . (Note values of below correspond to graphs where no vertices are typically in that block, so the effective minimum that can be considered for is .)
Fig. 4 shows curves for and i, the scaled asymptotic RE for pairs of vertices both in block one and pairs of vertices in different blocks, respectively, in terms of . We vary between 0 and 1 to demonstrate how the number of pairs of vertices with the corresponding block memberships impacts the overall relative efficiency. Note, achieves for and from different blocks when for all , which corresponds to in the 2block case. When the vertices are from the same block the scaled relative efficiency
If instead of assuming that the graphs follow an SBM distribution, we assume that the graphs are distributed according to an RDPG distribution, similar gains in relative efficiency can be realized. While there is no compact analytical formula for the relative efficiency of versus in the general RDPG case, using the same ideas as in Theorem 4.2, we can show that .
Proposition 4.3.
Suppose that are independently and identically distributed from an RDPG distribution with common latent positions , which are independently and identically distributed from some distribution. As the number of vertices , it holds for any that , where again the asymptotic relative efficiency in does not depend on .
The proof of this proposition closely follows the proofs of Lemma 4.1 and Theorem 4.2, and hence it is omitted here.
Remark 4.4.
As noted above, if the graphs are distributed according to an SBM or an RDPG, the relative efficiency is approximately invariant to the number of graphs when is large. If on the other hand, the graphs are generated according to a fullrank independent edge model, then the relative efficiency can change more dramatically as changes. The reason for this is because for larger , more of the eigenvectors of will begin to concentrate around the eigenvectors of the mean graph. This leads to the fact that the optimal embedding dimension for estimating the mean will increase, making and the lowrank approximation at the optimal dimension closer together. As a result, will increase as increases for fullrank models. Indeed, for large it is possible that since it is not guaranteeed that will choose the optimal dimension. The lack of gaps in the eigenvalues of the mean graph makes dimension reduction quite dangerous. In an extreme case, the lowrank assumption will be most violated when all eigenvalues of the mean graph are almost equal. This leads to a certain type of structure, which is close to a constant times the identity matrix. However, such structure is not seen in connectomics. This will be discussed further in Section 4.2 when applying the estimator to the SWU4 dataset.
4.2 Finite Sample Simulations
In this section, the theoretical results from Section 4.1 regarding the relative efficiency between and via Monte Carlo simulation experiments in an idealized setting will be illustrated. These numerical simulations will also allow us to investigate the finite sample performance of the two estimators. Note that in Section 4.6, the model assumptions will be broken slightly to run experiment in a more realistic setting.
Here, we consider the following 2block SBM with parameters
When calculating , the dimension selection step from Algorithm 1 is omitted and replaced with the true dimension . Note that for large , many dimension selection methods will often correctly select the true dimension (Chatterjee, 2015; Fishkind et al., 2012).
graphs from 1000 Monte Carlo replicates using the above SBM distribution with different numbers of vertices show the relative efficiency can be estimated since is known for this simulation. Since the relative efficiency only depends on the block memberships of the pair , as defined as the set of ordered pairs of vertices which belong to th block and th block respectively. The relative efficiency for each block pair can be estimated using
for , where denotes the estimated mean squared error based on the Monte Carlo replicates. For the remaining simulations and real data analysis, we will always be considering estimated relative efficiency and estimated mean squared error rather than analytic results, and hence we will frequently omit that these are estimated values.
In Fig. 5, we plot the (estimated) relative efficiency (top panel) and the scaled (estimated) relative efficiency (bottom panel), . The different dashed lines denote the RE and scaled RE associated with different block pairs, either , , or . As expected from Theorem 4.2, the top panel indicates that the relative efficiencies are all very close together and much less than 1, decreasing at the rate of , indicating that is performing better than .
Based on Theorem 4.2, the scaled RE converges to as for all pairs . This is plotted as a solid line in the bottom panel. The figure shows that converges to scaled asymptotic RE quite rapidly. Error bars were omitted, as the standard errors are very small for these estimates.
Remark 4.5.
An intriguing aspect of these finite sample results is that the scaled relative efficiencies behave differently for small graphs with fewer vertices. The estimates of the edge probabilities for pairs of vertices in different blocks are much better than the estimates for edges within each block. The reason for this is unclear and could be due to the actual values of the true probability, but it may also be due to the fact that there are approximately twice as many pairs of vertices in different blocks, , than there are in the same block, . This could lead to an increase in effective sample size which may cause the larger differences displayed in the left parts of Fig. 5. However, these differences are nearly indistinguishable for unscaled relative efficiency overall.
LowRank Estimator for Human Connectomes
In practice, observed graphs do not follow the independent edge model, let alone an RDPG or SBM, but the mean of a collection of graphs is still of interest for these cases. To demonstrate that the estimator is still useful in such cases, its performance on structural connectomic data was tested. The graphs are based on diffusion tensor MR images of SWU4 dataset collected and available at the Consortium for Reliability and Reproducibility (CoRR) (Zuo et al., 2014) (see Section A.4.1). The dataset contains 454 different brain scans, each of which was processed to yield an undirected, unweighted graph with no selfloops, using the pipeline described in (Kiar et al., 2017, 2016). The vertices of the graphs represent different regions in the brain defined according to an atlas. Here, three atlases were used: the JHU atlas with 48 vertices (Oishi et al., 2010), the Desikan atlas with 70 vertices (Desikan et al., 2006), and the CPAC200 atlas with 200 vertices (Sikka et al., 2014). An edge exists between two vertices whenever there is at least one whitematter tract connecting the corresponding two regions of the brain. Further details of the dataset are provided in Section A.4.
4.3 Estimating Mean Connectomes from Diffusion MRI Data
A cross validation on the 454 graphs of each size evaluated the performance of the two estimators. Specifically, for a given atlas, each Monte Carlo replicate corresponds to sampling graphs out of the 454 and computing the lowrank estimator and the sample mean using the selected graphs. These estimates were compared to the sample mean for the remaining adjacency matrices. While we cannot interpret this mean graph as the probability matrix for an IEM distribution (see Section 4.6), the sample mean for the remaining graphs does give the proportion of times each pair of vertices are adjacent in the population from the sampled graphs.
While in previous sections the mean squared error for either an individual entry or for an entire block in the SBM were evaluated, in this section and the next section we will focus on the overall error for estimating the mean graph. In particular, the average of the mean squared error across all pairs of vertices, in conjunction with and will determine the relative efficiency, where is defined as
and is similarly defined. As in the previous section, analytical evaluations of the MSE will not be evaluated, and instead estimates of the MSE and relative efficiencies via from Monte Carlo simulations will be employed.
1000 crossvalidation simulations on each of the three atlases were run for sample sizes of . For , there are only 454 distinct samples, so and is compared for each of these 454 possible samples of size 1. As long as we determine which dimension to embed, the two estimates and can be calculated based on the sample. In practice, we employed algorithms like Zhu and Ghodsi’s method or USVT to select the dimension . These methods are relatively easy to compute. Section A.2 discusses details of the methods. Fig. 6 shows plots of the estimated relative efficiencies between and .
For each atlas and each sample size, the Zhu and Ghodsi method (Zhu and Ghodsi, 2006) was compared with the USVT method (Chatterjee, 2015). Both have similar overall performance. Confidence intervals were omitted (calculated by assuming a normal distribution) for the estimated relative efficiencies since all confidence intervals have lengths less than . This confidence interval indicates that all relative efficiencies are significantly different from 1, aside from the relative efficiency for the CPAC200 atlas at .
Again, the largest improvements using occur when is small and is large, where the RE are smaller than 1. On the other hand, once , tends to do nearly as well or better than . In addition, offers certain advantages, especially since lowrank estimates can often be more easily interpretable by considering the latent position representation described in Section 2.3.
As discussed in Section 1, Fig. 1 further illustrates the differences between the two estimators for a samples with size and . For the sample with , was calculated using Zhu and Ghodsi’s 3rd elbow to select . As discussed above, has a finer gradient of estimated probabilities and has fewer outliers than , as shown in the upper triangular part of panels (b) and (e). Moreover, for the sample with size discussed above, Fig. 7 shows the values for the absolute estimation error and . In addition, the absolute difference is included to show the overall difference between the two estimates. The lower triangular sections show the actual absolute difference while the upper triangular matrix highlights the vertex pairs with absolute differences larger than 0.4. There are 18 edges for and only 6 edges for being highlighted in the figure. Note that approximately of all pairs of vertices are adjacent in all graphs and hence will always have zero error for those pairs of vertices. Nonetheless, typically outperforms .
To investigate the difference in performance with respect to the geometry of the brain, in Fig. 8 we plot the 50 edges with the largest differences according to the location of the corresponding regions in the brain. Red edges indicate that overestimates , while blue means that underestimates . The edge width is determined by the estimation error for , where pairs with larger estimation error are represented by thicker lines. The five regions corresponding to vertices that contribute most to the difference are also highlighted, which are the vertices with the largest value of .
Notably, three of these top five regions form a contiguous group of regions. The top five regions are the inferior temporal, middle temporal, and transverse temporal regions in the left hemisphere and the parahippocampal and pars opercularis regions in the right hemisphere of the Desikan atlas. Furthermore, the regions that differ most appear to be predominantly localized to the temporal lobe, where increased regionallyspecific noise in the diffusion weighted imagining data may increase the estimation error.
4.4 Challenges of the SWU4 Dataset
While our estimator performs well when the sample size is small and the number of vertices is large, the CoRR dataset itself does not strictly adhere to the lowrank assumptions of our theory. As discussed in Remark 4.4, whether the dataset has lowrank structure was first investigated. In Fig. 9, the relative error of using a rank approximation of (see Algorithm 2) is plotted as solid curves. The rate at which this curve tends to zero provides an indication of the relative performance of using as compared to when is large. For all three atlases, while these error rates do tend to zero relatively quickly, substantial errors remain for any lowrank approximation. This can be compared to the dashed lines which show how these errors would behave if was truly lowrank where the ranks are selected by Zhu and Ghodsi’s method. In particular, the selected dimensions are 13 for JHU, 8 for Desikan, and 37 for CPAC200. As it turns out, the SWU4 dataset is not even approximately lowrank.
Two other aspects of this dataset provide challenges for these lowrank methods. First, there are a large number of negative eigenvalues which will not capture. We can adapt our lowrank methods by including large negative eigenvalues as well. However, for low sample sizes excluding negative eigenvalues improved performance. Second, approximately 12.8% of the entries of are exactly equal to 1. For these edges, will always have exactly zero error, while will necessarily give a less accurate estimate.
Despite these challenges, our results show that when the sample size is relatively small, such as or , and for the atlases with a larger number of vertices, gives a better estimate than for the CoRR dataset. Importantly, this improvement is robust to the embedding dimension provided the dimension is not underestimated.
4.5 Lobe Structure behind the Lowrank Methods
In previous sections, we have shown how lowrank methods help us improve the accuracy of estimation while providing convenient interpretations simultaneously. In this section, the focus is on how the lobe structure is reflected in the lowrank estimate and the estimated latent positions in particular.
Classically, the brain can be divided into lobes, originally based purely on anatomical considerations, now widely recognized to also play a functional role Vanderah and Gould (2015). While different anatomists partition brain regions differently, there is general agreement on four cortical lobes per hemisphere: frontal, parietal, occipital, and temporal (Fischl, 2012; Desikan et al., 2006; Salat et al., 2004). For the Desikan atlas, there are 70 different regions (35 regions for each hemisphere), with each region belonging to a single lobe. However, three regions of the Desikan atlas per hemisphere (Banks of Superior Temporal Sulcus, Corpus Callosum, and the “Unknown” region) do not have obvious lobe assignment. These three regions were clustered into a new lobe category named “other” to resolve this issue.
In general, one might expect that properties of regions within a lobe are more similar to those across lobes, even upon conditioning on anatomical proximity, as regions within lobes would be expected to share more functional roles. To see whether the embedded latent positions preserve this property or not, we propose a test statistic to be the average differences between vertices within the same lobe minus the average differences between vertices across different lobes, i.e.
(2) 
where represents the lobe assignment for vertex . If the latent positions and the lobe assignment are independent, then will be close to zero. A small test statistic indicates that latent positions of the regions within the same lobe are closer compared to the ones across the lobes.
To test this hypothesis the lobe labels of each region were randomly permutated and the test statistics calculated based on the permuted lobe labels . After performing 1000 Monte Carlo replicates of unconditional permutations, the pvalue is less than .
However, the anatomical geometry might contribute to the dependence between and , with spatially proximal vertices having similar connectivity patterns. Hence, a small test statistic is evidence that the lowrank methods preserve the lobe structure only if we also condition on anatomy geometry: and are conditionally independent given anatomical geometry, and are conditionally dependent given anatomical geometry.
A test of these hypotheses will focus on how much of the lobe structure is really captured by the latent positions associated with the lowrank methods without being affected by the inherent spatial relationship. Note that the test of conditional independence, performed without any anatomical geometry constraints, has less power compared to the test of unconditional independence which is performed with a random permutation of lobe labels as discussed above.
To test under the anatomical geometry conditions, the lobe assignment was permutated in a way such that the number of regions in each lobe remain the same and the regions within the same randomly defined lobe are still spatially connected. A flip was defined to be a swap of two pairs of vertices which preserves the number of regions in each lobe and also maintains the constraint that lobes are spatially contiguous. The lobes are flipped a limited number of times in order to study how the number of flips impacts the test statistic. Appendix C discusses the flipping procedure.
1000 simulations with the test statistics of are shown for a fixed number of flips after the permutation. The number of flips was varied from 1 to 10 (Fig. 10). In the violin plot, the dashed line indicates the value of based on the true lobe assignment. for the true lobe assignment move away from the the quantile based for the random permutations. The figure shows corresponding pvalues. When the number of flips is larger than 7, the pvalue is less than 0.05, which suggests that latent positions in the same lobe are more similar to each other, even after accounting for the fact that geometrically proximal regions may also have similar latent positions. Note that when the number of flips is small, this test will have very little power since the null distribution is just a small deviation from the original lobe structure.
4.6 Synthetic Data Analysis for Full Rank IEM
While the theory we have developed is based on the assumption that the mean graph is low rank, as we have seen in Section 4.2, can perform well even when this assumption is false. To further illuminate this point, a synthetic data analysis under a more realistic fullrank independent edge model was performed. As discussed in Section 4.4, the sample mean of the 454 graphs in the Desikan dataset is actually of full rank. For this simulation, we will use the sample mean as the probability matrix . A sampling of independent graphs from the full rank IEM with the probability matrix show that for the synthetic data sets of size , and , performs even better than in the real data experiments. Fig. 11 shows the resulting estimated MSE for (solid line) and (dashed line), as a function of the embedding dimension for simulated data based on the full rank probability matrix shown in the left panel of Fig. 1. These results are similar to those presented in Section 4.2, though overall performs even better than in the real data experiments. When is small, outperforms with a flexible range of embedding dimensions including those selected by the Zhu and Ghodsi method. On the other hand, when is large enough, both estimators perform well with the decision between the two being less conclusive. This simulation again shows the robustness of to deviations from the RDPG model, specifically if the probability matrix is fullrank.
We also note that the finitesample relative efficiency for this synthetic data is even more favorable to than for the real data, with relative efficiency lower than for in the synthetic data analysis as compared to relative efficiency which were at best around for in the original data. From this observation, we can postulate that the degradation in the performance of in real data can at least partially be attributed to the fact that the independent edge assumption does not hold for real data. It also suggests that more elaborate models of connectomes will be valuable for various inferential tasks.
5 Application to a Mouse Connectome
As a further application of lowrank methods, an MRIDTI mouse brain connectome (Calabrese et al., 2015) with N=1 specimen was evaluated. The data acquisition protocol is described in the appendix, Section A.4.2, and resulted in a weighted, directed graphs with vertices again corresponding to regions in the brain. The 296 regions were organized into a multilevel, hierarchical structure. Analysis of the finegrained and the first level of the hierarchy partitioned the label set into eight superstructures, with four in each hemisphere: forebrain, midbrain, hindbrain, and white matter.
The original matrix is a weighed adjacency matrix with denoting the number of tracts passing through ROIs and . As the original weights had very heavy tails, these weights were transformed by setting was set to to transform the original weights, which had very heavy tails. This resulted in the weighted adjacency matrix in Figure 12 (a).
Using the procedure described in Algorithm 1, we found a lowrank approximation to the reweighted matrix . In this instance, the Zhu and Ghodsi (2006) procedure resulted in a rank7 approximation which is shown in the right panel of Figure 12. Since the sample size is only one, crossvalidation cannot be employed to analyze the prediction performance of the lowrank methods, but visually it appears that the rank7 approximation captures many of the features in the original adjacency matrix.
As with the human connectome, we sought to understand the relationship between the structure of the graph, as conveyed through the adjacency spectral embedding, and the eight superstructures which partition the regions of the mouse brain. Panel (a) of Figure 13 shows entries of the four scaled singular vectors of the weighted adjacency matrix corresponding to the largest singular values. The points are colored according to the four superstructures and the shapes are determined by the hemisphere. The ordering of the points groups together nodes in the same superstructure and hemisphere. The second and fourth vectors have structure which correlates closely with the four superstructures and the two hemispheres, respectively. Additionally, the first vector appears to separate the midbrain from the other three superstructures.
The right panel of Figure 13 shows a scatter plot of the entries of the fourth and second vectors along with the class boundaries for the eightclass quadratic discriminant analysis classifier, which is based on Gaussian mixture models with no constraints on the covariance structure Hastie et al. (2001). This classifier achieves a training error rate of . The error rate is particularly high for the white matter, with vertices being classified incorrectly, meaning that ignoring the white matter, vertices were misclassified. Panel (c) shows the normalized confusion matrix for the eight classes, indicating that the forebrain and hindbrain classes are well separated while the white matter and midbrain have more substantial overlap. This matches with the general structure of the white matter which is not defined at the first hierarchical level of the atlas according to spatial structure, while the fore, mid, and hindbrain superstructures are.
Finally, as for the eight human superstructures, the same permutation analysis was also performed for the mouse connectome. Figure 14 shows the violin plots for the metric defined in Eq. (2) permuted in the same way as described in the Appendix. This test again indicates that the eight superstructures are significant even after accounting for the spatial structure of the regions.
6 Discussion
Motivated by the RDPG model, our methodology takes advantage of the lowrank structure of graphs by applying a lowrank approximation to the entrywise MLE. We give a closed form for the asymptotic relative efficiency between the entrywise MLE and our estimator in the case of a stochastic blockmodel, demonstrating that when the number of vertices is sufficiently large, lowrank methods provide a substantial improvement. In particular, for a stochastic blockmodel with fixed number of blocks , block size proportion , and number of graphs , the lowrank estimator has MSE which is on the order of times lower than the MSE for .
Moreover, our estimator outperforms the entrywise MLE in a cross validation analysis of the SWU4 brain graphs and in low and fullrank simulation settings when is small. These results illustrate that performs well even when the lowrank assumption is violated and that is robust and can be applied in practice.
One of the key observations from our real data analysis was that the largest improvements using the lowrank method occurred when the number of graphs was small, and that it provided only minor improvements, or even slightly degraded performance, when was large. However, even in large scale studies the lowrank methods will be useful for estimating graph means for subpopulations, e.g. the population of females over 60 with some college education. Using the elementwise sample mean for such small strata, which may have fewer than ten subjects, will frequently result in a degradation of performance. Similarly, Durante et al. (2016) proposed a Bayesian nonparametric approach for modeling the population distribution of networkvalued data which reduces dimensionality via a mixture model and our methods could be easily adapted to those ideas.
While the lowrank methods considered in this paper will often offer substantial improvements, further refinements of these methods which account for the particular traits of connectomics data would be useful to improve estimation further. For example, we assume that the adjacency matrix is observed without contamination, however in practice there will be noise in the observed graph and one may seek to account for this noise with more robust methods. This may be especially fruitful when each graph has weighted edges and the weights themselves have noisy or heavytailed distributions. Rankbased methods and robust likelihood methods could be very useful in that case (Huber and Ronchetti, 2009; Qin and Priebe, 2013).
Another issue that arose in the analysis of the connectome dataset was the presence of structural ones in the mean graph for the population. These structural ones appear since edges between certain regions of the brain are present in all members of the healthy population. For these alwayspresent edges, the lowrank methods will have nonzero error while the sample mean will always have zero error. Detecting and incorporating structural ones and zeros could yield methods that share the best elements of both methods considered here.
For the SWU4 dataset, we performed a crossvalidation framework and compared the estimates based on a subsample to the mean for the heldout set. Another option would be to compare the estimates and to the mean for the entire population including the subsample. Both of these analyses lead to very similar results in the cases presented above, but for various reasons one may prefer one analysis over another. The crossvalidation method is most reasonable from a prediction perspective where prediction about new samples is of interest. If instead one is interested in learning directly about the mean of a population, especially a finite population, the subsampling approach may be the most logical choice.
While in this paper the focus on the estimation of the probability matrix based on the lowrank structure, many future directions are quite interesting, such as fitting the SBM or clustering the vertices to detect different brain regions. For example, Abraham et al. (2013) introduced a regionextraction approach based on a sparse penalty with dictionary learning; Calhoun et al. (2001) performed independet component analysis of fMRI data to draw group inferences; Wang et al. (2017) consider a joint embedding model for feature extractions. In future work, it would be interesting to explore further statistical inferences based on our method.
Acknowledgments
This work is graciously supported by the XDATA program of the Defense Advanced Research Projects Agency (DARPA) administered through Air Force Research Laboratory contract FA87501220303; the DARPA SIMPLEX program through SPAWAR contract N6600115C4041; and DARPA GRAPHS contract N660011414028. We would also like to acknowledge support from NIH through K01 AG041211, and P41 EB015897.
References
 Abraham et al. [2013] Alexandre Abraham, Elvis Dohmatob, Bertrand Thirion, Dimitris Samaras, and Gael Varoquaux. Extracting brain regions from rest fmri with totalvariation constrained dictionary learning. In MICCAI16th International Conference on Medical Image Computing and Computer Assisted Intervention2013. Springer, 2013.
 Airoldi et al. [2008] Edoardo M Airoldi, David M Blei, Stephen E Fienberg, and Eric P Xing. Mixed membership stochastic blockmodels. Journal of Machine Learning Research, 9(Sep):1981–2014, 2008.
 Anderson et al. [2017] Robert J Anderson, James J Cook, Natalie A Delpratt, John C Nouls, Bin Gu, James O McNamara, Brian B Avants, G Allan Johnson, and Alexandra Badea. An HPC pipeline with validation framework for small animal multivariate brain analysis (SAMBA). September 2017.
 Atasoy et al. [2016] Selen Atasoy, Isaac Donnelly, and Joel Pearson. Human brain networks function in connectomespecific harmonic waves. Nature communications, 7:10340, January 2016.
 Athreya et al. [2016] Avanti Athreya, Carey E Priebe, Minh Tang, Vince Lyzinski, David J Marchette, and Daniel L Sussman. A limit theorem for scaled eigenvectors of random dot product graphs. Sankhya A, 78(1):1–18, 2016.
 Behrens et al. [2007] T E J Behrens, H Johansen Berg, S Jbabdi, M F S Rushworth, and M W Woolrich. Probabilistic diffusion tractography with multiple fibre orientations: What can we gain? NeuroImage, 34(1):144–155, January 2007.
 Bickel and Doksum [2007] Peter J Bickel and Kjell A Doksum. Mathematical Statistics: Basic Ideas and Selected Topics, volume i. Pearson Prentice Hall, second edition, 2007.
 Bollobás et al. [2007] Béla Bollobás, Svante Janson, and Oliver Riordan. The phase transition in inhomogeneous random graphs. Random Structures & Algorithms, 31(1):3–122, 2007.
 Brown and Rutemiller [1977] Gerald G Brown and Herbert C Rutemiller. Means and variances of stochastic vector products with applications to random linear models. Management Science, 24(2):210–216, 1977.
 Calabrese et al. [2015] Evan Calabrese, Alexandra Badea, Gary Cofer, Yi Qi, and G Allan Johnson. A diffusion MRI tractography connectome of the mouse brain and comparison with neuronal tracer data. Cereb. Cortex, 25(11):4628–4637, November 2015.
 Calhoun et al. [2001] Vince D Calhoun, Tulay Adali, Godfrey D Pearlson, and JJ Pekar. A method for making group inferences from functional mri data using independent component analysis. Human brain mapping, 14(3):140–151, 2001.
 Chatterjee [2015] Sourav Chatterjee. Matrix estimation by universal singular value thresholding. The Annals of Statistics, 43(1):177–214, 2015.
 Desikan et al. [2006] Rahul S Desikan, Florent Ségonne, Bruce Fischl, Brian T Quinn, Bradford C Dickerson, Deborah Blacker, Randy L Buckner, Anders M Dale, R Paul Maguire, Bradley T Hyman, et al. An automated labeling system for subdividing the human cerebral cortex on mri scans into gyral based regions of interest. Neuroimage, 31(3):968–980, 2006.
 Durante et al. [2016] Daniele Durante, David B Dunson, and Joshua T Vogelstein. Nonparametric bayes modeling of populations of networks. Journal of the American Statistical Association, (justaccepted), 2016.
 Erdős and Rényi [1959] P Erdős and A Rényi. On random graphs, I. Publicationes Mathematicae Debrecen, 6:290–297, 1959.
 Fischl [2012] Bruce Fischl. Freesurfer. Neuroimage, 62(2):774–781, 2012.
 Fishkind et al. [2012] Donniell E Fishkind, Daniel L Sussman, Minh Tang, Joshua T Vogelstein, and Carey E Priebe. Consistent adjacencyspectral partitioning for the stochastic block model when the model parameters are unknown. 2012.
 Garyfallidis et al. [2014] Eleftherios Garyfallidis, Matthew Brett, Bagrat Amirbekian, Ariel Rokem, Stefan van der Walt, Maxime Descoteaux, Ian NimmoSmith, and Dipy Contributors. Dipy, a library for the analysis of diffusion MRI data. Frontiers in neuroinformatics, 8:8, February 2014.
 Gilbert [1959] E N Gilbert. Random graphs. Annals of Mathematical Statistics, 30(4):1141–1144, 1959.
 Ginestet et al. [2014] Cedric E Ginestet, Prakash Balanchandran, Steven Rosenberg, and Eric D Kolaczyk. Hypothesis testing for network data in functional neuroimaging. arXiv preprint arXiv:1407.5525, 2014.
 Gorgolewski et al. [2015] Krzysztof J Gorgolewski, Natacha Mendes, Domenica Wilfling, Elisabeth Wladimirow, Claudine J Gauthier, Tyler Bonnen, Florence JM Ruby, Robert Trampel, PierreLouis Bazin, Roberto Cozatl, et al. A high resolution 7tesla restingstate fmri testretest dataset with cognitive and physiological measures. Scientific data, 2, 2015.
 Gray et al. [2012] William Gray, John Bogovic, Joshua Vogelstein, Bennett Landman, Jerry Prince, and R Vogelstein. Magnetic resonance connectome automated pipeline: An overview. IEEE Pulse, 2(3):42–48, 2012.
 Gutmann [1982] Sam Gutmann. Stein’s paradox is impossible in problems with finite sample space. The Annals of Statistics, pages 1017–1020, 1982.
 Hastie et al. [2001] Trevor Hastie, Robert Tibshirani, and Jerome Friedman. The elements of statistical learning. Springer Series in Statistics. New York, NY, USA, 2001.
 Hoff et al. [2002] Peter D Hoff, Adrian E Raftery, and Mark S Handcock. Latent space approaches to social network analysis. Journal of the american Statistical association, 97(460):1090–1098, 2002.
 Holland et al. [1983] Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt. Stochastic blockmodels: First steps. Social networks, 5(2):109–137, 1983.
 Huber and Ronchetti [2009] Peter J. Huber and Elvezio M. Ronchetti. Robust statistics. Wiley Series in Probability and Statistics. John Wiley & Sons, Inc., Hoboken, NJ, second edition, 2009. ISBN 9780470129906.
 James and Stein [1961] W. James and Charles Stein. Estimation with quadratic loss. In Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Vol. I, pages 361–379. Univ. California Press, Berkeley, Calif., 1961.
 Jiang et al. [2001] Xiaoyi Jiang, Andreas Müunger, and Horst Bunke. On median graphs: Properties, algorithms, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10):1144–1151, 2001.
 Karrer and Newman [2011] Brian Karrer and Mark EJ Newman. Stochastic blockmodels and community structure in networks. Physical Review E, 83(1):016107, 2011.
 Kiar et al. [2016] Gregory Kiar, William Gray Roncal, Disa Mhembere, Eric Bridgeford, Randal Burns, and Joshua T. Vogelstein. ndmg: Neurodata’s mri graphs pipeline. http://m2g.io, August 2016.
 Kiar et al. [2017] Gregory Kiar, Krzysztof J Gorgolewski, Dean Kleissas, William Gray Roncal, Brian Litt, Brian Wandell, Russel A Poldrack, Martin Wiener, R Jacob Vogelstein, Randal Burns, et al. Science in the cloud (sic): A use case in mri connectomics. Giga Science, 6(5):1–10, 2017.
 Marchette et al. [2011] David Marchette, Carey Priebe, and Glen Coppersmith. Vertex nomination via attributed random dot product graphs. In Proceedings of the 57th ISI World Statistics Congress, volume 6, page 16, 2011.
 Margulies et al. [2016] Daniel S Margulies, Satrajit S Ghosh, Alexandros Goulas, Marcel Falkiewicz, Julia M Huntenburg, Georg Langs, Gleb Bezgin, Simon B Eickhoff, F Xavier Castellanos, Michael Petrides, Elizabeth Jefferies, and Jonathan Smallwood. Situating the defaultmode network along a principal gradient of macroscale cortical organization. Proceedings of the National Academy of Sciences of the United States of America, 113(44):12574–12579, November 2016.
 Nickel [2008] Christine Leigh Myers Nickel. Random Dot Product Graphs A Model For Social Networks. PhD thesis, Johns Hopkins University, 2008.
 Oishi et al. [2010] Kenichi Oishi, Andreia V Faria, Peter CM van Zijl, and Susumu Mori. MRI atlas of human white matter. Academic Press, 2010.
 Qin and Priebe [2013] Yichen Qin and Carey E Priebe. Maximum l qlikelihood estimation via the expectationmaximization algorithm: A robust estimation of mixture models. Journal of the American Statistical Association, 108(503):914–928, 2013.
 Qiu et al. [2017] Jiang Qiu, Qinglin Zhang, and Dongtao Wei. Swu 4  southwest university connectome data. http://fcon_1000.projects.nitrc.org/indi/CoRR/html/swu_4.html, 2017. Accessed: 20171201.
 Salat et al. [2004] David H Salat, Randy L Buckner, Abraham Z Snyder, Douglas N Greve, Rahul SR Desikan, Evelina Busa, John C Morris, Anders M Dale, and Bruce Fischl. Thinning of the cerebral cortex in aging. Cerebral cortex, 14(7):721–730, 2004.
 Scheinerman and Tucker [2010] Edward R Scheinerman and Kimberly Tucker. Modeling graphs using dot product representations. Computational Statistics, 25(1):1–16, 2010.
 Sikka et al. [2014] S Sikka, B Cheung, R Khanuja, S Ghosh, C Yan, Q Li, J Vogelstein, R Burns, S Colcombe, C Craddock, et al. Towards automated analysis of connectomes: The configurable pipeline for the analysis of connectomes (cpac). In 5th INCF Congress of Neuroinformatics, Munich, Germany, volume 10, 2014.
 Stein [1956] Charles Stein. Inadmissibility of the usual estimator for the mean of a multivariate normal distribution. In Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, vol. I, pages 197–206. University of California Press, Berkeley and Los Angeles, 1956.
 Sussman et al. [2014] Daniel L Sussman, Minh Tang, and Carey E Priebe. Consistent latent position estimation and vertex classification for random dot product graphs. IEEE transactions on pattern analysis and machine intelligence, 36(1):48–57, 2014.
 Trunk [1979] G. V. Trunk. A problem of dimensionality: A simple example. Pattern Analysis and Machine Intelligence, IEEE Transactions on, (3):306–307, 1979.
 Vanderah and Gould [2015] Todd Vanderah and Douglas J Gould. Nolte’s The Human Brain: An Introduction to its Functional Anatomy, 7e. Elsevier, 7 edition edition, 1 June 2015.
 Wang et al. [2017] Shangsi Wang, Joshua T Vogelstein, and Carey E Priebe. Joint embedding of graphs. arXiv preprint arXiv:1703.03862, 2017.
 Young and Scheinerman [2007] Stephen J Young and Edward R Scheinerman. Random dot product graph models for social networks. In Algorithms and models for the webgraph, pages 138–149. Springer, 2007.
 Zhu and Ghodsi [2006] Mu Zhu and Ali Ghodsi. Automatic dimensionality selection from the scree plot via the use of profile likelihood. Computational Statistics & Data Analysis, 51(2):918–930, 2006.
 Zuo et al. [2014] XiNian Zuo, Jeffrey S Anderson, Pierre Bellec, Rasmus M Birn, Bharat B Biswal, Janusch Blautzik, John CS Breitner, Randy L Buckner, Vince D Calhoun, F Xavier Castellanos, et al. An open science resource for establishing reliability and reproducibility in functional connectomics. Scientific data, 1, 2014.
Appendix A Methods
a.1 Algorithm for lowrank approximation
a.2 Choosing Dimension
Often in dimensionality reduction techniques, the choice for dimension , relies on analyzing the set of the ordered eigenvalues, looking for a “gap” or “elbow” in the screeplot. Zhu and Ghodsi [2006] present an automated method for finding this gap in the screeplot that takes only the ordered eigenvalues as an input and uses Gaussian mixture modeling to find these gaps. The mixture modeling results in multiple candidate dimensions or elbows, and our analysis indicated that underestimating the dimension is much more harmful than overestimating the dimension. For this reason, the 3rd elbow was employed in the experiments performed for this work. While Zhu and Ghodsi [2006] only defines the 1st elbow, we define the th elbow as in Algorithm 3.
Universal Singular Value Thresholding (USVT) is a simple estimation procedure proposed in Chatterjee [2015] that can work for any matrix that has “a little bit of structure”. In the current setting, it selects the dimension as the number of singular values that are greater than a constant times . The specific constant must be selected carefully based on the mean and variance of the entries, and since overestimating the dimension was not overly harmful, we chose a relatively small value of .
Overall, selecting the appropriate dimension is a challenging task and numerous methods could be applied successfully depending on the setting. On the other hand, in our setting, many dimensions will yield nearly optimal mean squared errors and the two methods did not pick drastically different dimensions. Thus efforts to ensure the selected dimension is in the appropriate range are more important than finding the best dimension.
a.2.1 Exploration of Dimension Selection Procedures
To further investigate the impact of the dimension selection procedures, we also considered all possible dimensions for by ranging from 1 to . of and was plotted in Fig. 15. The horizontal axis gives dimension , which only impacts , which is why estimated MSE of is shown as flat. When is small, underestimates the dimension and throws away important information, which leads to relatively poor performance. When , is equal to , so that the curve for for ends at . In the figure, a triangle denotes the 3rd elbow found by the Zhu and Ghodsi method, and a square denotes the dimension selected by USVT with threshold 0.7. Both dimension selection algorithms tend to select dimensions which nearly minimize the mean squared error.
When is 1 or 5, has large variance which leads to large . Meanwhile, reduces the variance by taking advantages of inherent lowrank structure of the mean graph. Such smoothing effect is especially obvious while there is only 1 observation. When , all weights of the graph are either 0 or 1, leading to a very bumpy estimate . In this case, smooths the connectomes estimate and improves the performance. Additionally, there is a large range of dimensions where the performance for is superior to . With a larger , the performance of improves so that its performance is frequently superior but nearly identical to .
a.3 Graph Diagonal Augmentation
The graphs examined in this work have no selfloops and thus the diagonal entries of the adjacency matrix and the mean graph are all zero. However, when computing the lowrank approximation, these structural zeros lead to increased errors in the estimation of the mean graph. While this problem has been investigated in the single graph setting, with multiple graphs, the problem is exacerbated since the variance of the other entries is lower, so the relative impact of the bias in the diagonal entries is higher. Moreover, the sum of eigenvalues of the hollow matrix will be zero, leading to an indefinite matrix, which violates the positive semidefinite assumption. So it is important to remedy the situation that we don’t observe the diagonal entries.
Marchette et al. [2011] proposed the simple method of imputing the diagonals to be equal to the average of the nondiagonal entries for the corresponding row, or in equivalently the degree of the vertex divided by . Earlier, Scheinerman and Tucker [2010] proposed using an iterative method to impute the diagonal entries. In this work, these two ideas are combined by first using the rowaverage method (see Step 3 of Algorithm 1) and then using one step of the iterative method (see Step 6 of Algorithm 1). Note that when computing errors, the diagonal entries are omitted since these are known to be zero.
a.4 Dataset Description
a.4.1 Human Connectomes
The original dataset is from the Emotion and Creativity One Year Retest Dataset provided by Qiu, Zhang and Wei from Southwest University available at the Consortium for Reliability and Reproducibility (CoRR) [Zuo et al., 2014, Gorgolewski et al., 2015]. It is composed of 235 subjects, all of whom were college students. Each subject underwent two sessions of anatomical, resting state DTI scans, spaced one year apart. Due to incomplete data, only 454 scans are available.
When deriving MR connectomes, the NeuroData team parcellates the brain into groups of voxels as defined by anatomical atlases [Kiar et al., 2016]. The atlases are defined either physiologically by neuroanatomists (Desikan and JHU), or are generated using an automated segmentation algorithm (CPAC200). Once the voxels in the original image space are grouped into regions, an edge is placed between two regions when there is at least one whitematter tract, derived using a tractography algorithm, connecting the corresponding two parts of the brain [Garyfallidis et al., 2014]. The resulting graphs are undirected, unweighted, and have no selfloops.
a.4.2 Mouse Connectome
Images of the fixed specimen were acquired on a 9.4 T small animal magnet using a 3D diffusion weighted imaging sequence. 120 unique diffusion directions were acquired using a b value of 4000 s/mm2, interleaved with 11 nondiffusion weighted scans. Images were acquired in 235 hours, and reconstructed at 43 micron resolution. The mouse brain was labeled with 296 regions of interest, 148 per hemisphere [Anderson et al., 2017].
To construct a structural connectome of the mouse brain fiber data was reconstructed (max 4 fiber orientations/voxel), then probabilistic tractography was performed using FSL [Behrens et al., 2007], (5000 samples per voxel, 21 m step size, 45 degrees curvature threshold). The 296 seed regions had connectivity estimates produced by counting the number of fibers that originate from one region and fall onto all other regions. This was normalized by the volume of the seed region and resulted in a 296x296 weighted, directed graph.
a.5 Outline for the Proof of the Theorems
Here the proof of Lemma 4.1 is outlined, which provides the approximate MSE of in the stochastic blockmodel case. The result depends on using the asymptotic results (see Theorem B.1) for the distribution of eigenvectors from Athreya et al. [2016] which extend to the multiple graph setting in a straightforward way.
The first key observation is that since is computed from iid observations each with expectation , is unbiased for and . The results of Athreya et al. [2016] provide a central limit theorem for estimates of the latent position in an RDPG model for a single graph. Theorem B.1 describes important details. Since the variance of each entry is scaled by in , the analogous result for is that the estimated latent positions will follow an approximately normal distribution with variance scaled by compared to the variance for a single graph.
Since is a noisy version of the dot product of from Section 2.3 and each is approximately independent and normal, we can use common results for the variance of the inner product of two independent multivariate normals [Brown and Rutemiller, 1977]. After simplifications that occur in the stochastic blockmodel setting, we can derive that the variance of converges to