Lecture

Physarum can compute shortest paths

In course

Consectetur Lorem nostrud ullamco qui labore ullamco Lorem dolore commodo. Magna dolore est magna occaecat enim Lorem in id in aute culpa. Do nulla aliqua ut nisi est sint proident magna exercitation aliqua do mollit. Deserunt in velit pariatur ipsum fugiat. Pariatur laboris aliqua enim qui fugiat elit laboris nostrud. Commodo reprehenderit occaecat occaecat aliqua do labore aute in do laboris amet duis velit pariatur. Sunt officia ipsum laborum cupidatat officia occaecat ipsum occaecat id.

Description

This lecture explores how Physarum Polycephalum, a slime mold, can compute shortest paths in a directed graph model. It delves into the unit flow routing in the graph, equilibrium points, and Lyapunov functions.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

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

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

Number theory: Number theory

Systems science and engineering

Systems theory: Chaos theory

Related lectures (37)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.