FAST COMMUNITY IDENTIFICATION BY HIERARCHICAL GROWTH

DOI10.1142/S0129183107011042zbMATH Open1152.91760arXivphysics/0602144OpenAlexW3106353813MaRDI QIDQ3499084FDOQ3499084

Authors: Francisco A. Rodrigues, Gonzalo Travieso, Luciano da F. Costa 

Publication date: 28 May 2008

Published in: International Journal of Modern Physics C (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/physics/0602144

Recommendations

• Fast unfolding of communities in large networks
• Hierarchical Community Detection by Recursive Partitioning
• Fast community detection by SCORE
• Fast hyperbolic mapping based on the hierarchical community structure in complex networks
• Detecting Hierarchical Communities in Networks: A New Approach

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Connectivity (05C40)

Cites Work

• Complex networks: structure and dynamics
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• A faster algorithm for betweenness centrality*
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles

Cited In (6)

• Fast hyperbolic mapping based on the hierarchical community structure in complex networks
• Identify implicit communities by graph clustering
• A fast and efficient algorithm to identify clusters in networks
• Hierarchies of predominantly connected communities
• Fast unfolding of communities in large networks
• Fast community detection by SCORE

This page was built for publication: FAST COMMUNITY IDENTIFICATION BY HIERARCHICAL GROWTH

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499084)