Lecture

Connectivity-Informed Brain Activity Interpretation

Related lectures (31)

Introduces the basics of brain connectomics, including terminology, data preprocessing, functional MRI, connectivity measures, and modular structure.

Brain Connectomics: Basics of Neuroimaging

Covers the basics of brain connectomics, including brain networks, terminology, data schemes, preprocessing, node connectivity, and functional connectome structure.

Graph Models and Brain Connectomics

Explores graph theory in brain connectomics, MRI applications, network analysis relevance, and individual fingerprinting.

Introduction to Networks and Brain Networks

Introduces the fundamentals of network science, focusing on brain networks and their historical breakthroughs.

Graph Theory in Neural Signal Processing

Explores neural signal processing through graph theory, multivariate methods, and fMRI analysis.

Neural Signals and Connectomes

Explores neural signals, connectomes, graph theory, and multi-voxel pattern analysis in fMRI trials.

Neuronal Connectivity Patterns

Explores neuronal connectivity patterns, connection probabilities, and experimental techniques used to study synaptic connectivity.

Sparsest Cut: ARV Theorem

Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.

Statistical analysis of network data

Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.

Belief Propagation

Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.

Spectral Clustering: Theory and Applications

Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.

Data-Driven Modeling in Neuroscience: Meenakshi Khosla

By Meenakshi Khosla explores data-driven modeling in large-scale naturalistic neuroscience, focusing on brain activity representation and computational models.

Graph Theory and Network Flows

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Networked Control Systems: Opportunities

Explores coordination in networked control systems, graph theory, and consensus algorithms.

Interlacing Families and Ramanujan Graphs

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Cheeger's Inequalities

Explores Cheeger's inequalities for random walks on graphs and their implications.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Sparsest Cut and Concurrent Flow

Covers sparsest cut, NP-completeness, Bougains Theorem, and concurrent flow in graphs.

Shortest Path Algorithms: BFS and Dijkstra

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.