A General Definition of Network Communities and the Corresponding Detection Algorithm
Lists
Only you see this
Abstract
Network structures, consisting of nodes and edges, have applications in almost all subjects. A set of nodes is called a community if the nodes have strong interrelations. Industries (including cell phone carriers and online social media companies) need community structures to allocate network resources and provide proper and accurate services. However, all the current detection algorithms are motivated by the practical problems, whose applicabilities in other fields are open to question. Thence, for a new community problem, researchers need to derive algorithms ad hoc, which is arduous and even unnecessary. In this paper, we represent a general procedure to find community structures in practice. We mainly focus on two typical types of networks: transmission networks and similarity networks. We reduce them to a unified graph model, based on which we propose a general method to define and detect communities. Readers can specialize our general algorithm to accommodate their problems. In the end, we also give a demonstration to show how the algorithm works.
BibTeX
@article{lu2019general,
author = {Haoye Lu and Amiya Nayak},
title = {{A General Definition of Network Communities and the Corresponding Detection Algorithm}},
journal = {Future Internet},
year = {2019},
doi = {10.3390/fi11020041},
}| Community Structures Are Definable in Networks, and Universal in Real World | arXiv · 2013 |
| The stability of a graph partition: A dynamics-based framework for community detection | arXiv · 2013 |
| GenPerm: A Unified Method for Detecting Non-overlapping and Overlapping Communities | arXiv · 2016 |
| Quantifying and identifying the overlapping community structure in networks | Journal of Statistical Mechanics Theory and Experiment · 2009 |
| A classification for community discovery methods in complex networks | arXiv · 2012 |
| Community Detection in Networks: The Leader-Follower Algorithm | arXiv · 2010 |