In recent times, the study of real-world networks has gained prominence in the field of theoretical computer science. In my talk, I will show results from the analysis of the email traffic from the Karlsruhe Institute of Technology (KIT), proving that the KIT email graph is both a scale-free network and a small-world network. Furthermore, I will propose a method to determine graph clusterings based on a modified version of randomized rumor spreading protocols.