An upper bound on community size in scalable community detection

Details An upper bound on community size in scalable community detection An upper bound on community size in scalable community detection

2011-03-29

arxiv.org/abs/1103.5569v1

Physics

Physics and Society

4 pages, 1 figure

Scientific paper

It is well-known that community detection methods based on modularity optimization often fails to discover small communities. Several objective functions used for community detection therefore involve a resolution parameter that allows the detection of communities at different scales. We provide an explicit upper bound on the community size of communities resulting from the optimization of several of these functions. We also show with a simple example that the use of the resolution parameter may artificially force the complete disaggregation of large and densely connected communities.

Affiliated with

Also associated with

No associations

Rating

An upper bound on community size in scalable community detection 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 An upper bound on community size in scalable community detection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An upper bound on community size in scalable community detection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-162973