Lecture
Paths, Diffusion, and Navigation
Description
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.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.