Lecture

Facebook Social Graph: Structure and Small-World Phenomenon

Related lectures (31)

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

Explores neural signals, connectomes, graph theory, and multi-voxel pattern analysis in fMRI trials.

Explores graph theory in brain connectomics, MRI applications, network analysis relevance, and individual fingerprinting.

Graph Algorithms II: Traversal and Paths

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

Introduction to Networks and Brain Networks

Introduces the fundamentals of network science, focusing on brain networks and their historical breakthroughs.

Networked Control Systems: Opportunities

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

Statistical analysis of network data

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

Graph Theory and Network Flows

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

Shortest Path Algorithms: BFS and Dijkstra

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Dynamic Programming: Shortest Paths Algorithms

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.

Sparsest Cut: ARV Theorem

Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.

Graph Theory: Girth and Independence

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

Belief Propagation

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

Shortest Paths: Negative Weights

Explores Bellman-Ford algorithm for negative weight graphs and currency exchange rates.

Connectivity in Graph Theory

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

Cheeger's Inequalities

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

Cavity Method: Mean Field Theory

Explores the Cavity Method in Mean Field Theory, analyzing spins in an external field within a graph.

Dijkstra's Algorithm Overview

Demonstrates the iterative process of applying Dijkstra's algorithm to find optimal paths.

Assembly: Physics of Manufacturing

Discusses the importance of assembly in manufacturing and covers common couplings, stability, and spatial vectors.

Minimum Spanning Trees: Prim's Algorithm

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