Criterions for locally dense subgraphs

Details Criterions for locally dense subgraphs Criterions for locally dense subgraphs

2011-03-17

arxiv.org/abs/1103.3397v3

Physics

Physics and Society

Revised version. 26 pages, 8 figures, 1 table

Scientific paper

Community detection is one of the most investigated problems in the field of complex networks. Although several methods were proposed, there is still no precise definition of communities. As a step towards a definition, I highlight two necessary properties of communities, separation and internal cohesion, the latter being a new concept. I propose a local method of community detection based on two-dimensional local optimization, which I tested on common benchmarks and on the word association database.

Affiliated with

Also associated with

No associations

Rating

Criterions for locally dense subgraphs 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 Criterions for locally dense subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Criterions for locally dense subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-248167