arXiv · 1312.4224
A paradox in community detection
Abstract
Recent research has shown that virtually all algorithms aimed at the identification of communities in networks are affected by the same main limitation: the impossibility to detect communities, even when these are well-defined, if the average value of the difference between internal and external node degrees does not exceed a strictly positive value, in literature known as detectability threshold. Here, we counterintuitively show that the value of this threshold is inversely proportional to the intrinsic quality of communities: the detection of well-defined modules is thus more difficult than the identification of ill-defined communities.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Filippo Radicchi. 2014-05-06. A paradox in community detection. https://doi.org/10.1209/0295-5075%2F106%2F38001
Cite the original work for its findings. Save a collection to share your selection of sources.