Lectures related to Symplectic Rigidity: Forms of Symplectic Rigidity

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

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

Covers the analysis of functions, composition, and mathematical induction.

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

Covers functions, integers, GCD, and reasoning by recurrence, including the Euclidean algorithm and induction principle.

Covers graphical models for probability distributions and factor graphs representation.

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Explores the ubiquity of graphs in modern data and analytics, focusing on the shift in organizations' perception of graph technologies.