On 29 november 2016 Hamed Ghasemieh defended his MSc thesis entitled `Influence of short cycles on the PageRank distribution in scale-free random graphs'.
PageRank, invented by Google to rank web pages, is an important algorithm in networks analysis but its dependence on the structure of the underlying network is largely unknown. Hamed studied a very difficult problem of how short directed cycles such as loops and triangles affect the distribution of PageRank. This is an important question, because triangles often occur in real-life networks.
Remarkable, Hamed has completed his MSc in Applied Mathematics cum laude, in parallel with a PhD in Computer Science! Our congratulations to Hamed and good luck with his forthcoming PhD defense!