Modularity-Maximizing Network Communities via Mathematical Programming

Physics – Data Analysis – Statistics and Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to EPJB. 9 pages, 3 EPS figures

Scientific paper

10.1140/epjb/e2008-00425-1

In many networks, it is of great interest to identify "communities", unusually densely knit groups of individuals. Such communities often shed light on the function of the networks or underlying properties of the individuals. Recently, Newman suggested "modularity" as a natural measure of the quality of a network partitioning into communities. Since then, various algorithms have been proposed for (approximately) maximizing the modularity of the partitioning determined. In this paper, we introduce the technique of rounding mathematical programs to the problem of modularity maximization, presenting two novel algorithms. More specifically, the algorithms round solutions to linear and vector programs. Importantly, the linear programing algorithm comes with an a posteriori approximation guarantee: by comparing the solution quality to the fractional solution of the linear program, a bound on the available "room for improvement" can be obtained. The vector programming algorithm provides a similar bound for the best partition into two communities. We evaluate both algorithms using experiments on several standard test cases for network partitioning algorithms, and find that they perform comparably or better than past algorithms.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Modularity-Maximizing Network Communities via Mathematical Programming 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 Modularity-Maximizing Network Communities via Mathematical Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modularity-Maximizing Network Communities via Mathematical Programming will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-404178

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.