Infomap is a dynamics based community detection algorithm, which identifies communities in the network by measuring the flow of information through the network using random walks \citep*{rosvall2008maps}. The rationale behind the method is that due to the higher density of edges within communities, the random walkers will be trapped and spend a longer time inside communities. Infomap further improved the early implementations of the dynamics based algorithms by using information theory to define the most parsimonious way to describe graph community structure. Infomap is especially effective when applied to directed networks, where it can identify communities that would not be detected by modularity optimisation algorithms.