Title	Gossip, Latency, and Weighted Conductance
Creator	Gilbert, Seth
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-11-30T11:00
Description	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.
Extent	29 minutes
Subject	Mathematics; Computer science; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: National University of Singapore
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2017-06-22
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0348414
URI	http://hdl.handle.net/2429/62094
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos