TU Berlin

Research Group Algorithmics and Computational ComplexityTalk 11.10.2012

isti-logo

Page Content

to Navigation

Rumor Spreading in Social Networks

Prof. Dr. Tobias Friedrich (Friedrich-Schiller-Universität Jena)

Understanding structural and algorithmic properties of complex networks is important not only because of the huge economic impact of the internet. It has been observed that information spreads extremely fast in social networks. We analyze how news spread in the preferential attachment (PA) model of Barabasi/Albert. For a simple synchronous protocol, we prove a rumor spreading time of Theta(log n/loglog n) on PA graphs with n nodes, which is less than on most other graph topologies. Moreover, we prove that introducing asynchrony reduces this time even further.

Date
Speaker
Location
Language
11.10.2012 17:15
Tobias Friedrich
TEL 512
english/german*

Back to the research colloquium site.

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe