Lecture
Networks: Paths
Related lectures (32)
Graph Theory: Path Weighted by Amplitude
Covers the calculation of paths in a graph, focusing on amplitude-weighted paths.
Algorithmic Paradigms for Dynamic Graph Problems
Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Introduction to Shortest Path
Introduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.
Counterfactuals: SEM and D-Separation
Explores counterfactuals in SEMs and D-Separation in graphical models.
Networks: Structure and Properties
Explores the structure and properties of networks, including dating and protein networks, small-world effect, hubs, and scale-free property.
Facebook Social Graph: Structure and Small-World Phenomenon
Examines the Facebook social graph structure, small-world phenomenon, four degrees of separation, and user homophily.
Epidemic Spreading Models
Covers classical models of epidemic spreading and dynamics on networks with examples.
Dynamic Programming: Shortest Paths Algorithms
Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.
Introduction to Networks and Brain Networks
Introduces the fundamentals of network science, focusing on brain networks and their historical breakthroughs.
Non-parametric regression for networks
Explores non-parametric regression for networks, covering object data analysis, network graphs, extrinsic distances, and practical projections.