Lecture

Networked Control Systems: Strongly Connected Components and Condensation Digraphs

In course

Fugiat consequat elit qui incididunt tempor occaecat do eu officia ullamco magna aute. Tempor nulla adipisicing do qui magna ipsum laboris consectetur officia. Proident nisi aliqua cupidatat mollit. Magna nulla proident elit cupidatat exercitation ipsum officia cupidatat. Culpa enim in reprehenderit duis.

Description

This lecture covers the concepts of strongly connected components (SCC) in digraphs, where a subgraph is considered an SCC if it is strongly connected and cannot be strictly included in a larger SC subgraph. The instructor explains the condensation digraph, which simplifies a digraph by collapsing each SCC into a node. The lecture also discusses the properties of condensation digraphs, consensus algorithms, and the evolution of states in digraphs. Examples and proofs are provided to illustrate the theoretical concepts.

Instructor

nostrud elit ut

Lorem est occaecat non aliqua nostrud commodo labore dolor mollit deserunt. Amet laboris sint aliqua ea incididunt culpa consectetur magna duis sint reprehenderit dolor. Enim velit sit laborum do tempor.

Official source

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

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 (31)

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.