Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2204.05110

Comparative Survey of Multigraph Integration Methods for Holistic Brain Connectivity Mapping

Nada Chaari·Hatice Camgoz Akdag·Islem Rekik
View original source ↗Read source document ↗Export metadata ↓

Abstract

One of the greatest scientific challenges in network neuroscience is to create a representative map of a population of heterogeneous brain networks, which acts as a connectional fingerprint. The connectional brain template (CBT), also named network atlas, presents a powerful tool for capturing the most representative and discriminative traits of a given population while preserving its topological patterns. The idea of a CBT is to integrate a population of heterogeneous brain connectivity networks, derived from different neuroimaging modalities or brain views (e.g., structural and functional), into a unified holistic representation. Here we review current state-of-the-art methods designed to estimate well-centered and representative CBT for populations of single-view and multi-view brain networks. We start by reviewing each CBT learning method, then we introduce the evaluation measures to compare CBT representativeness of populations generated by single-view and multigraph integration methods, separately, based on the following criteria: centeredness, biomarker-reproducibility, node-level similarity, global-level similarity, and distance-based similarity. We demonstrate that the deep graph normalizer (DGN) method significantly outperforms other multi-graph and all single-view integration methods for estimating CBTs using a variety of healthy and disordered datasets in terms of centeredness, reproducibility (i.e., graph-derived biomarkers reproducibility that disentangle the typical from the atypical connectivity variability), and preserving the topological traits at both local and global graph-levels.

Explore related subjects

q-bio.NCcs.AIcs.LG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nada Chaari, Hatice Camgoz Akdag, Islem Rekik. 2022-04-05. Comparative Survey of Multigraph Integration Methods for Holistic Brain Connectivity Mapping. https://arxiv.org/abs/2204.05110

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Inter- and Intra-Subject Variability in EEG: A Systematic Survey

Electroencephalography (EEG) underpins neuroscience, clinical neurophysiology, and brain-computer interfaces (BCIs), yet pronounced inter- and intra-subject variability limits reliability, reproducibility, and translation. This systematic review studies that quantified or modeled EEG variability across resting-state, event-related potentials (ERPs), and task-related/BCI paradigms (including motor imagery and SSVEP) in healthy and clinical cohorts. Across paradigms, inter-subject differences are typically larger than within-subject fluctuations, but both affect inference and model generalization. Stability is feature-dependent: alpha-band measures and individual alpha peak frequency are often relatively reliable, whereas higher-frequency and many connectivity-derived metrics show more heterogeneous reliability; ERP reliability varies by component, with P300 measures frequently showing moderate-to-good stability. We summarize major sources of variability (biological, state-related, technical, and analytical), review common quantification and modeling approaches (e.g., ICC, CV, SNR, generalizability theory, and multivariate/learning-based methods), and provide recommendations for study design, reporting, and harmonization. Overall, EEG variability should be treated as both a practical constraint to manage and a meaningful signal to leverage for precision neuroscience and robust neurotechnology.

q-bio.NC↗
arXiv2026

EEG Lempel-Ziv Complexity vis-à-vis Autocorrelation Function

Measures of signal complexity have become increasingly popular in electroencephalography (EEG), where they are often interpreted as indicators of neural information processing, dynamical richness, or conscious state. In contrast, classical measures of temporal dependence, such as the autocorrelation function (ACF), remain more directly linked to known physiological mechanisms and are easier to interpret. The present work revisits, for the EEG practicioner, the relation between normalized Lempel-Ziv complexity (LZC) and temporal autocorrelation in both synthetic and physiological EEG signals. First, synthetic time series exhibiting a broad range of temporal structure and complexity levels were generated using stochastic processes with varying degrees of temporal dependence. LZC and autocorrelation measures were then computed and compared. Across simulated signals, a robust inverse relationship was observed between normalized LZC and the first autocorrelation coefficient, indicating that signals with stronger temporal correlations exhibit lower complexity estimates. This relationship also holds in resting-state EEG recordings from healthy adult participants across channels and subjects, as well as dynamically during eyes open/close maneuvers. Overall, these results show that the information captured by LZC reflects temporal redundancy already quantified by conventional autocorrelation measures. Because autocorrelation measures relate more directly to established neurophysiological mechanisms, including oscillatory persistence, network synchronization, and temporal integration, these results suggest that interpreting complexity-based EEG findings should explicitly account for their dependence on conventional temporal statistics, which may provide a more transparent framework for mechanistic inferences.

q-bio.NC↗
arXiv2026

Distributional signatures of computation: inferring mechanisms from computation time distributions

Computational complexity theory provides a framework for analysing abstract models of computation, whereas computational systems operate as finite physical implementations whose behaviour is shaped by their architecture and physical substrate. In such systems, computational organisation cannot be directly characterised from algorithms or internal representations. Building on the use of reaction time distributions to constrain mechanisms in cognitive science, we introduce an empirical framework for investigating computation in physical systems by inferring computational mechanisms from observable computation time distributions. The framework combines empirical benchmarking, which characterises computational efficiency through the scaling of computation time with problem size, with distributional analysis, which treats computation time distributions as signatures of the stochastic dynamics generated by different computational mechanisms. We demonstrate the framework using a scalable visual search paradigm, comparing human performance with three computational models that employ distinct mechanisms of evidence accumulation. Benchmarking reveals broadly similar scaling behaviour for the models and human observers, whereas distributional analysis distinguishes between these models. We show that computation time distributions provide an empirical level of description linking observable computational behaviour to underlying computational mechanisms. This framework complements computational complexity theory by extending the empirical study of computation from measuring computational performance to characterising computational organisation. It provides an empirical approach for comparing finite computational systems across diverse physical implementations, including biological, classical, neuromorphic, and quantum systems, without requiring access to their internal algorithms or architectures.

q-bio.NC↗