Distance (graph theory)

Related lectures (32)

Page 2 of 4

Explains message passing in graphical models and the matching problem in graph theory.

Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.

Explores the concept of minimizing guardians in graphs through strategic edge selection.

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

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

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

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

Explores belief propagation on graphs, emphasizing normalization, recursive relations, and iterative computation of the partition function.

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

Covers the Stochastic Block Model and its application in community detection, exploring its mathematical formulation and challenges.