Campus Event Calendar
Event Entry
New for: D3
What and Who
Randomized Rumor Spreading in Social Networks
Benjamin Doerr
Max-Planck-Institut für Informatik - D1
Talk
AG 1, AG 3, AG 5, SWS, AG 4, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 3 March 2011
14:00
30 Minutes
E1 4
3rd floor rotunda
Saarbrücken
Abstract
I'll give an informal talk about a recent result of Mahmoud Fouz, Tobias Friedrich, and myself to appear in STOC 2011. I talked about this in January in a practice talk for Sydney, but all our SODA attendees could not attend that time.
The results is that randomized rumor spreading disseminates a piece of information significantly faster in preferential attachment graphs than in all previously studied classical topologies like complete graphs, random graphs, hypercubes etc. Preferential attachment graphs are one popular model for ``real-world'' graphs, in particular, social networks. Experiments suggest that our theoretical finding can also be observed in reality.
Contact
Benjamin Doerr
--email hidden
passcode not visible
logged in users only
Benjamin Doerr, 03/02/2011 09:47 -- Created document.