GEFF: Graph embedding for functional fingerprinting.

It has been well established that Functional Connectomes (FCs), as estimated from functional MRI (fMRI) data, have an individual fingerprint that can be used to identify an individual from a population (subject-identification). Although identification rate is high when using resting-state FCs, other tasks show moderate to low values. Furthermore, identification rate is task-dependent, and is low when distinct cognitive states, as captured by different fMRI tasks, are compared. Here we propose an embedding framework, GEFF (Graph Embedding for Functional Fingerprinting), based on group-level decomposition of FCs into eigenvectors. GEFF creates an eigenspace representation of a group of subjects using one or more task FCs (Learning Stage). In the Identification Stage, we compare new instances of FCs from the Learning subjects within this eigenspace (validation dataset). The validation dataset contains FCs either from the same tasks as the Learning dataset or from the remaining tasks that were not included in Learning. Assessment of validation FCs within the eigenspace results in significantly increased subject-identification rates for all fMRI tasks tested and potentially task-independent fingerprinting process. It is noteworthy that combining resting-state with one fMRI task for GEFF Learning Stage covers most of the cognitive space for subject identification. Thus, while designing an experiment, one could choose a task fMRI to ask a specific question and combine it with resting-state fMRI to extract maximum subject differentiability using GEFF. In addition to subject-identification, GEFF was also used for identification of cognitive states, i.e. to identify the task associated to a given FC, regardless of the subject being already in the Learning dataset or not (subject-independent task-identification). In addition, we also show that eigenvectors from the Learning Stage can be characterized as task- and subject-dominant, subject-dominant or neither, using two-way ANOVA of their corresponding loadings, providing a deeper insight into the extent of variance in functional connectivity across individuals and cognitive states.

Toward an information theoretical description of communication in brain networks.

Modeling communication dynamics in the brain is a key challenge in network neuroscience. We present here a framework that combines two measurements for any system where different communication processes are taking place on top of a fixed structural topology: path processing score (PPS) estimates how much the brain signal has changed or has been transformed between any two brain regions (source and target); path broadcasting strength (PBS) estimates the propagation of the signal through edges adjacent to the path being assessed. We use PPS and PBS to explore communication dynamics in large-scale brain networks. We show that brain communication dynamics can be divided into three main "communication regimes" of information transfer: absent communication (no communication happening); relay communication (information is being transferred almost intact); and transducted communication (the information is being transformed). We use PBS to categorize brain regions based on the way they broadcast information. Subcortical regions are mainly direct broadcasters to multiple receivers; Temporal and frontal nodes mainly operate as broadcast relay brain stations; visual and somatomotor cortices act as multichannel transducted broadcasters. This work paves the way toward the field of brain network information theory by providing a principled methodology to explore communication dynamics in large-scale brain networks.

Uncovering differential identifiability in network properties of human brain functional connectomes.

The identifiability framework (𝕀f) has been shown to improve differential identifiability (reliability across-sessions and -sites, and differentiability across-subjects) of functional connectomes for a variety of fMRI tasks. But having a robust single session/subject functional connectome is just the starting point to subsequently assess network properties for characterizing properties of integration, segregation, and communicability, among others. Naturally, one wonders whether uncovering identifiability at the connectome level also uncovers identifiability on the derived network properties. This also raises the question of where to apply the 𝕀f framework: on the connectivity data or directly on each network measurement? Our work answers these questions by exploring the differential identifiability profiles of network measures when 𝕀f is applied (a) on the functional connectomes, and (b) directly on derived network measurements. Results show that improving across-session reliability of functional connectomes (FCs) also improves reliability of derived network measures. We also find that, for specific network properties, application of 𝕀f directly on network properties is more effective. Finally, we discover that applying the framework, either way, increases task sensitivity of network properties. At a time when the neuroscientific community is focused on subject-level inferences, this framework is able to uncover FC fingerprints, which propagate to derived network properties.