Common and individual structure of brain networks

DOI10.1214/18-AOAS1193MaRDI QIDQ2415447zbMATH OpenOpenAlexFDO

Authors Lu Wang, Zhengwu Zhang, David Dunson

Publication date 22 May 2019

Published in The Annals of Applied Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.06360, https://projecteuclid.org/euclid.aoas/1554861642

zbMATH Keywords

binary networksmultiple graphspenalized logistic regressionrandom effectsspectral embedding

Mathematics Subject Classification ID

Applications of graph theory (05C90) Generalized linear models (logistic models) (62J12) Inference from stochastic processes and spectral analysis (62M15) Applications of statistics to biology and medical sciences; meta analysis (62P10)

Abstract: This article focuses on the problem of studying shared- and individual-specific structure in replicated networks or graph-valued data. In particular, the observed data consist of $n$ graphs, $G_i,i=1,ldots,n$, with each graph consisting of a collection of edges between $V$ nodes. In brain connectomics, the graph for an individual corresponds to a set of interconnections among brain regions. Such data can be organized as a $VimesV$ binary adjacency matrix $A_i$ for each $i$, with ones indicating an edge between a pair of nodes and zeros indicating no edge. When nodes have a shared meaning across replicates $i=1,ldots,n$, it becomes of substantial interest to study similarities and differences in the adjacency matrices. To address this problem, we propose a method to estimate a common structure and low-dimensional individual-specific deviations from replicated networks. The proposed Multiple GRAph Factorization (M-GRAF) model relies on a logistic regression mapping combined with a hierarchical eigenvalue decomposition. We develop an efficient algorithm for estimation and study basic properties of our approach. Simulation studies show excellent operating characteristics and we apply the method to human brain connectomics data.

Recommendations

• Fused multiple graphical lasso
• Simultaneous Cluster Structure Learning and Estimation of Heterogeneous Graphs for Matrix-Variate fMRI Data
• A group analysis using the multiregression dynamic models for fMRI networked time series
• Learning population and subject-specific brain connectivity networks via mixed neighborhood selection
• Common reducing subspace model and network alternation analysis

Cited in

(19)

• Estimating a network from multiple noisy realizations
• Multilayer brain networks
• Additive and multiplicative effects network models
• A latent space model for multilayer network data
• Network classification with applications to brain connectomics
• EEG-based functional brain networks: hemispheric differences in males and females
• Testing for Equivalence of Network Distribution Using Subgraph Counts
• Learning from binary multiway data: probabilistic tensor decomposition and its statistical optimality
• Inference for multiple heterogeneous networks with a common invariant subspace
• Fused multiple graphical lasso
• Genetic Underpinnings of Brain Structural Connectome for Young Adults
• Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization
• Optimal estimation and computational limit of low-rank Gaussian mixtures
• Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition
• Relaxation of the rank-1 tensor approximation using different norms
• Continuous and atlas-free analysis of brain structural connectivity
• Multiple network embedding for anomaly detection in time series of graphs
• A robust Bayesian latent position approach for community detection in networks with continuous attributes
• Bayesian Adaptive Tucker Decompositions for Tensor Factorization

This page was built for publication: Common and individual structure of brain networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415447)