Summer of Math Exposition

Randomized gossip algorithms are commonly used for sharing information in distributed computer systems. Despite being used in production systems for almost four decades, tight bounds on the performance of these algorithms are still being revised. I analyze the performance of randomized gossip algorithms on several different graphs and provide a simplified proof for the expected and right-tail performance of the algorithm.