ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Connectivité fonctionnelle dynamique×Analyse des réseaux cérébraux par graphes×
DomaineNeuro-imagerieNeuro-imagerie
FamilleProcess / pipelineProcess / pipeline
Année d'origine20132009
Auteur d'origineRyan M. HutchisonEd Bullmore
TypeResting-state fMRI connectivity pipelineBrain network graph analysis pipeline
Source fondatriceHutchison, R. M., Womelsdorf, T., Allen, E. A., et al. (2013). Dynamic functional connectivity: promise, problems, and perspectives. NeuroImage, 80, 360–378. link ↗Bullmore, E., & Sporns, O. (2009). Complex brain networks: graph theoretical analysis of structural and functional systems. Nature Reviews Neuroscience, 10(3), 186–198. DOI ↗
AliasdFC, time-varying connectivity, sliding window connectivitygraph theory, brain network analysis, network neuroscience
Apparentées33
RésuméDynamic Functional Connectivity (dFC) is an analytical framework that tracks changes in functional connectivity between brain regions over time, rather than averaging connectivity across an entire scanning session. Systematized by Hutchison and colleagues in 2013, dFC reveals how brain networks reorganize moment-to-moment, providing insights into transient brain states and cognitive flexibility.Graph Theoretical Brain Network Analysis applies network science to understand brain organization, treating the brain as a complex network of interconnected nodes (regions) and edges (connections). Formalized by Bullmore and Sporns in 2009, graph analysis reveals fundamental organizational principles—modularity, efficiency, resilience—that characterize healthy and diseased brains.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Dynamic Functional Connectivity · Graph Brain Network Analysis. Consulté le 2026-06-15 sur https://scholargate.app/fr/compare