BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

Gossip, Latency, and Weighted Conductance Gilbert, Seth


In this talk I will explore the problem of gossip in graphs where edges have latencies, giving near matching upper and lower bounds (within polylog factors). Along the way, we will define a notion of "weighted conductance" to capture the connectivity of a graph with latencies. Weighted conductance determines the performance of gossip protocols (and, perhaps, random walks) in graphs with latencies, much in the way that traditional conductance does in unweighted graphs.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International