Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Topology of Complexes Arising in Models for Distributed Computing

Hausdorff Center for Mathematics via YouTube

Overview

Explore a lecture on the topology of complexes in distributed computing models. Delve into various simplicial models, focusing on iterated chromatic subdivisions and their applications. Examine the Weak Symmetry Breaking example to understand how distributed computing questions translate into combinatorial-simplicial problems. Discover how this approach generates intriguing new questions across multiple mathematical fields. Learn about input and output complexes, protocol complexes, standard chromatic subdivisions, special order partitions, and permutations. Investigate Schlegel diagrams, snapshot protocols, one-round execution, and view complexes. Gain insights into the intersection of algebraic topology and distributed computing through this comprehensive exploration of complex topological structures and their practical implications.

Syllabus

Introduction
Algebraic Topology
nettles wrecked apology
Input and output complexes
Protocol complexes
Models of computation
Standard chromatic subdivision
Special order partitions
Permutations
Subdivision
Schlegel diagram
First step
Collapse
Snapshot protocols
One round execution
Additional triangles
Community of proof
View complexes
Hybrid complexes

Taught by

Hausdorff Center for Mathematics

Reviews

Start your review of Topology of Complexes Arising in Models for Distributed Computing

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.