Decentralized Systems: Gossip Protocol

Related lectures (29)

Page 3 of 3

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Explains isomorphic graphs through examples and the relationship with identical graphs.

Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Covers the fundamentals of Markov chains and their applications in algorithms, focusing on proper coloring and the Metropolis algorithm.

Introduces elementary graph algorithms, focusing on Breadth-First Search and Depth-First Search.

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.

Discusses graph algorithms, focusing on flow networks and strongly connected components.