Assembly: Mechanism Theory

Related lectures (30)

Page 3 of 3

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

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

Covers linear programming duality and complementary slackness condition.

Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.

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

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

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

Explores the design of heat exchanger networks, optimizing connections and configurations for efficient heat recovery.

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

Explores distances on graphs, cut norms, spanning trees, blockmodels, metrics, norms, and ERGMs in network data analysis.