Randomized Rumor Spreading in the Karlsruhe Email Graph (Bachelor Thesis Initial Talk)

information in networks. The underlying principle is that in each round, every node chooses a random neighbor to exchange information.
Simulations on real data seem to support various claims from theory.

In my talk, I will present my current results in the field of rumour spreading simulations in a real-world network, showing experimental results such as the runtime and behaviour of the various protocol types,
and suggesting the network's scale-freeness and that it has the small-world property.