Ograniczenia w wyszukiwaniu społeczności w sieciach ukierunkowanych
[Limitations of finding communities in directed networks]

Mateusz Wiliński (QF Group, Scuola Normale Superiore, Pisa, Italy)


Community detection is one of the key problems in network science. It was successfully 
applied to social networks, systemic risk estimation, biological networks and much 
more. The literature is full of different algorithms, which are able to find mesoscopic 
structures in networks. Some are suited for particular situations, others are more 
general. It turns out, however, that regardless of the algorithm used, there are strict 
theoretical limits to the problem of community detection. In my talk I will talk about 
those limits and focus on the case of directed networks.