Fast Community Identification by Hierarchical Growth

Details Fast Community Identification by Hierarchical Growth Fast Community Identification by Hierarchical Growth

2006-02-21

arxiv.org/abs/physics/0602144v1

Physics

Physics and Society

6 pages, 5 figures

Scientific paper

10.1142/S0129183107011042

A new method for community identification is proposed which is founded on the analysis of successive neighborhoods, reached through hierarchical growth from a starting vertex, and on the definition of communities as a subgraph whose number of inner connections is larger than outer connections. In order to determine the precision and speed of the method, it is compared with one of the most popular community identification approaches, namely Girvan and Newman's algorithm. Although the hierarchical growth method is not as precise as Girvan and Newman's method, it is potentially faster than most community finding algorithms.

Affiliated with

Also associated with

No associations

Rating

Fast Community Identification by Hierarchical Growth 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 Fast Community Identification by Hierarchical Growth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Community Identification by Hierarchical Growth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-454622