Concept
Distance (graph theory)
Related lectures (126)
Distances and Motif Counts
Explores distances on graphs, cut norms, spanning trees, blockmodels, metrics, norms, and ERGMs in network data analysis.
Convergence of Random Walks
Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.
Embedding Graphs into Trees
Covers embedding graphs into trees with a focus on minimizing distortion and Bartal Tree embeddings.
Graph Theory: Path Weighted by Amplitude
Covers the calculation of paths in a graph, focusing on amplitude-weighted paths.
Assembly: Physics of Manufacturing
Discusses the importance of assembly in manufacturing and covers common couplings, stability, and spatial vectors.
Message passing in graphical models
Explains message passing in graphical models and the matching problem in graph theory.
Max Sum Diversification
Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
Graph Theory: Girth and Independence
Covers girth, independence, probability, union bound, sets, and hypergraph recoloring.
Statistical analysis of network data
Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.
Cheeger's Inequalities
Explores Cheeger's inequalities for random walks on graphs and their implications.