Community extraction for social networks

Community extraction for social networks
Notice: This research summary and analysis were automatically generated using AI technology. For absolute accuracy, please refer to the [Original Paper Viewer] below or the Original ArXiv Source.

Analysis of networks and in particular discovering communities within networks has been a focus of recent work in several fields, with applications ranging from citation and friendship networks to food webs and gene regulatory networks. Most of the existing community detection methods focus on partitioning the entire network into communities, with the expectation of many ties within communities and few ties between. However, many networks contain nodes that do not fit in with any of the communities, and forcing every node into a community can distort results. Here we propose a new framework that focuses on community extraction instead of partition, extracting one community at a time. The main idea behind extraction is that the strength of a community should not depend on ties between members of other communities, but only on ties within that community and its ties to the outside world. We show that the new extraction criterion performs well on simulated and real networks, and establish asymptotic consistency of our method under the block model assumption.


💡 Research Summary

The paper addresses a fundamental limitation of most community‑detection algorithms: they force every vertex of a network into a partition, assuming that each community is densely connected internally and sparsely connected to the rest of the graph. In many real‑world graphs—social, biological, citation, or infrastructure—there exist vertices that do not belong clearly to any community (e.g., peripheral users, hub proteins, interdisciplinary scholars). Forcing such vertices into a community can distort the measured cohesion of genuine groups and lead to misleading conclusions.

To overcome this problem the authors propose a new framework called community extraction. Instead of partitioning the whole graph at once, the method extracts one community at a time, evaluates it independently of any other community, and then removes its vertices before searching for the next one. The extraction criterion is based on a simple ratio:

\


Comments & Academic Discussion

Loading comments...

Leave a Comment