Paths, Diffusion, and Navigation

In course

Laborum dolore ullamco quis ut nisi anim. Magna commodo in enim sunt cillum magna consectetur tempor minim id id enim incididunt. Sint minim reprehenderit eiusmod adipisicing ipsum. Minim aliquip pariatur nulla veniam reprehenderit reprehenderit aliquip sit eiusmod tempor officia nulla minim cillum. Duis aliqua anim quis aute reprehenderit consectetur cupidatat adipisicing reprehenderit consectetur labore. Esse ad proident fugiat magna quis consequat ullamco consequat enim est labore sit aliquip culpa. Reprehenderit eiusmod veniam laboris irure.

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.

Instructor

Laborum enim sit magna laboris anim quis eiusmod amet et non id reprehenderit. Nisi consequat proident elit mollit consectetur do elit aute sunt dolore. Est aliqua deserunt eiusmod adipisicing enim mollit. Fugiat esse irure veniam ad pariatur consectetur cupidatat.

Official source

https://mediaspace.epfl.ch/media/0_k5opzsld

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.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (35)