JHA410H1 Lecture Notes - Lecture 11: Connectome, Neuroimaging, White Matter
Document Summary
Brain graphs are well-suited to handle such large-scale datasets. What is a graph: any nodes (vertices; represent a brain region/part of the brain) connected by lines or edges, edges can connect nodes in any possible way (no rules) Structure (white matter track) or functional (activity connections) connectivity between nodes : different types of edges in graphs. Directed edge there is only a path from a the origin to b, the destination. Undirected edge the path between a and b is bidirectional, meaning origin and destination are not fixed. Usually structural connection: mathematics, graphs are a way to formally represent a network of objects that are all interconnected, graphs are defined as pairs of vertices and edges with the following formula: Graph = constellation of vertices and edges: formula provides different results depending on undirected vs directed graphs. Directed vertices and edges are ordered (direction matters) Undirected vertices and edges are unordered (unlike trees, there is no hierarchy)
