Physics – Physics and Society
Scientific paper
2011-02-04
Physics
Physics and Society
Journal of Computer and System Sciences, 2012
Scientific paper
10.1016/j.jcss.2012.04.003
Given a graph of interactions, a module (also called a community or cluster) is a subset of nodes whose fitness is a function of the statistical significance of the pairwise interactions of nodes in the module. The topic of this paper is a model-based community finding approach, commonly referred to as modularity clustering, that was originally proposed by Newman and has subsequently been extremely popular in practice. Various heuristic methods are currently employed for finding the optimal solution. However, the exact computational complexity of this approach is still largely unknown. To this end, we initiate a systematic study of the computational complexity of modularity clustering. Due to the specific quadratic nature of the modularity function, it is necessary to study its value on sparse graphs and dense graphs separately. Our main results include a (1+\eps)-inapproximability for dense graphs and a logarithmic approximation for sparse graphs. We make use of several combinatorial properties of modularity to get these results. These are the first non-trivial approximability results beyond the previously known NP-hardness results.
DasGupta Bhaskar
Desai Devendra
No associations
LandOfFree
On the Complexity of Newman's Community Finding Approach for Biological and Social Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Complexity of Newman's Community Finding Approach for Biological and Social Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Newman's Community Finding Approach for Biological and Social Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-492034