Paths, Diffusion, and Navigation

This lecture covers the concepts of paths in networks, including walks, trails, and paths. It also delves into the brain's structural connectome, Dijkstra's algorithm for finding shortest paths, global and nodal network efficiency, and network communicability. The importance of following the shortest path in the brain and the challenges of shortest path routing are discussed, along with network navigation and the Milgram experiment. The lecture concludes with a look at navigation in scale-free networks and a reminder about the upcoming midterm.