mlsanityData to 7 Oct 2026

Hypothesis Testing For Network Data in Functional Neuroimaging

arXiv 1407.5525 ↗First posted 21 Jul 2014stat.AP q-bio.NC stat.MEcited by 20

Not on the map. Why?

Abstract (arXiv)

In recent years, it has become common practice in neuroscience to use networks to summarize relational information in a set of measurements, typically assumed to be reflective of either functional or structural relationships between regions of interest in the brain. One of the most basic tasks of interest in the analysis of such data is the testing of hypotheses, in answer to questions such as "Is there a difference between the networks of these two groups of subjects?" In the classical setting, where the unit of interest is a scalar or a vector, such questions are answered through the use of familiar two-sample testing strategies. Networks, however, are not Euclidean objects, and hence classical methods do not directly apply. We address this challenge by drawing on concepts and techniques from geometry, and high-dimensional statistical inference. Our work is based on a precise geometric characterization of the space of graph Laplacian matrices and a nonparametric notion of averaging due to Fr'echet. We motivate and illustrate our resulting methodologies for testing in the context of networks derived from functional neuroimaging data on human subjects from the 1000 Functional Connectomes Project. In particular, we show that this global test is more statistical powerful, than a mass-univariate approach. In addition, we have also provided a method for visualizing the individual contribution of each edge to the overall test statistic.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Jul 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 9; 2023: 1; 2024: 2; 2025: 2; 2026: 2.

20 papers.

Sort:

  1. 2022Shape And Structure Preserving Differential Privacycited by 6
  2. 2021Hypothesis Testing for Equality of Latent Positions in Random Graphscited by 5
  3. 2022Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labelscited by 3
  4. 2022Theoretical analysis and computation of the sample Frechet mean for sets of large graphs based on spectral informationcited by 2
  5. 2022Clustered Graph Matching for Label Recovery and Graph Classificationcited by 2
  6. 2024Network two-sample test for block modelscited by 2
  7. 2025Scalable Geometric Learning with Correlation-Based Functional Brain Networkscited by 2
  8. 2021On the Number of Edges of the Frechet Mean and Median Graphscited by 1
  9. 2021Differentially Describing Groups of Graphscited by 1
  10. 2022Higher-order accurate two-sample network inference and network hashingcited by 1
  11. 2023Nested stochastic block model for simultaneously clustering networks and nodescited by 1
  12. 2024When does the mean network capture the topology of a sample of networks?cited by 1
8 more
  1. 2021Approximate Fr'echet Mean for Data Sets of Sparse Graphscited by 0
  2. 2022Sharp Threshold for the Frechet Mean (or Median) of Inhomogeneous Erdos-Renyi Random Graphscited by 0
  3. 2022Outlier Detection for Multi-Network Datacited by 0
  4. 2022Energy Trees: Regression and Classification With Structured and Mixed-Type Covariatescited by 0
  5. 2022Estimation of the Sample Frechet Mean: A Convolutional Neural Network Approachcited by 0
  6. 2025The Spectral Barycentre of a Set of Graphs with Community Structurecited by 0
  7. 2026Matching and mixing: Matchability of graphs under Markovian errorcited by 0
  8. 2026Metric space valued Fr'echet regressioncited by 0