Lecture

Graph Theory in Neural Signal Processing

Related lectures (30)

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

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

Fundamentals of Brain Connectomics

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 Theory and Network Flows

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

Connectivity-Informed Brain Activity Interpretation

Explores integrating brain connectivity to decode and interpret brain activity using graph signal processing and spectral residual networks.

Graphical Models: Representing Probabilistic Distributions

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Introduction to Networks and Brain Networks

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

Neuronal Connectivity Patterns

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

Minimum Spanning Trees: Prim's Algorithm

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

Graph Algorithms II: Traversal and Paths

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

Statistical analysis of network data

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

Graphs: Properties and Representations

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Fixed Points in Graph Theory

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Connectivity in Graph Theory

Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.

Spectral Clustering: Theory and Applications

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

Networked Control Systems: Opportunities

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

Shortest Path Algorithms: BFS and Dijkstra

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

Graph Theory Fundamentals

Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.

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.