Lecture

Soft Graphs and Subgraphs

Related lectures (29)

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

Introduction to Graph Theory

Covers the basics of graph theory, including network flows, degrees of vertices, walks, and subgraphs.

Graph Theory and Network Flows

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

Graph Theory: Connectivity and Properties

Explores the properties of undirected and directed graphs, emphasizing connectivity and network topology modeling.

Statistical analysis of network data

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

Convergence of Random Walks

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

Graphical Models: Representing Probabilistic Distributions

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

Cheeger's Inequalities

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

Probabilistic method and its applications

Introduces the probabilistic method to prove existence results in graph theory.

Belief Propagation

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

Unweighted Bipartite Matching

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Handshake Problem: Graph Representation

Explores a classic handshake problem at a party using graph representation.

Cartesian Product: Graph Operations

Explores the Cartesian product operation on graphs and introduces the concept of cubes.

Linear Programming Duality

Covers linear programming duality and complementary slackness condition.

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.

Markov Chains: Applications and Analysis

Explores Markov chains, focusing on the coloring problem and algorithm analysis.

Minimum Spanning Trees: Prim's Algorithm

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

Networked Control Systems: Opportunities

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

Graph Theory: Girth and Independence

Covers girth, independence, probability, union bound, sets, and hypergraph recoloring.

Belief Propagation for Graph Coloring

Explores Belief Propagation for graph coloring and its convergence properties.