Lecture

Graph Sketching

Related lectures (29)

Embedding Graphs into Trees

Covers embedding graphs into trees with a focus on minimizing distortion and Bartal Tree embeddings.

Automorphism groups of trees and graphs

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.

Graph Algorithms: Modeling and Traversal

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Graph Algorithms: Modeling and Representation

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.

Convergence of Random Walks

Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.

Directed Networks & Hypergraphs

Explores directed networks with asymmetric relationships and hypergraphs that generalize graphs by allowing edges to connect any subset of nodes.

Graph Theory and Network Flows

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

Subgraphs vs Induced Subgraphs

Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.

Graphical Models: Representing Probabilistic Distributions

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

Graph Theory Fundamentals

Explores fundamental graph theory concepts, Erdős' results, Chromatic Lemma, and Union Bound theorem in graph theory.

Shortest Path Algorithms: BFS and Dijkstra

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

Graphs and Networks: Basics and Applications

Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.

Sparsest Cut: Leighton-Rao Algorithm

Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.

Networked Control Systems: Coordination Among Agents

Explores coordination among agents in networked control systems through graph theory and real-world examples.

Graph Algorithms II: Traversal and Paths

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

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.

Graph Algorithms: Basics

Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.

Handling Networks: Graph Theory

Covers the fundamentals of handling networks and centrality measures in graph theory.

Graph Coloring: Random vs Symmetrical

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

Graphs: Properties and Representations

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