Real-life networks often display community structure. The Louvain algorithm  is an influential efficient method for finding communities in networks. This algorithm is a standard part of many software packages such as the widely used graph visualization platform Gephi. Improvements and modifications of the algorithm have been suggested and used e.g. for large-scale analysis of citation networks , and for a more general problem of maximizing the likelihood of communities .
(i) evaluate the quality of iterative community detection algorithms, such as the Louvain algorithm, by ana-lyzing these algorithms on random graphs with a known community structure;
|Supervisors||Remco van der Hofstad(TU/e), Nelly Litvak (TU/e)|
|PhD Student||Martijn Gösgens|
|Location||Eindhoven University of Technology (TU/e)|