abstract: In this lecture, we will discuss how to design optimal gossip algorithms for given network structure and applications of such algorithms. The optimal design will involve constructing fast mixing Markov chains. Applications will include design of network scheduling algorithms, quantized load balancing and totally distributed algorithms for convex optimization problems.