Free Energy and Semi-classical Propagator

Related lectures (30)

Page 1 of 3

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

Covers the basics of information theory, entropy, and fixed points in graph colorings and the Ising model.

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

Covers the concept of graph sketching with a focus on connected components.

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

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

Presents the position space approach to banana Feynman diagrams and their differential equations.

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

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

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