Abstract
An algorithm is proposed to detect community structure in social network. The algorithm begins with a community division based on prior knowledge of the degrees of the nodes, and then combines the communities until a clear partition is obtained. In applications such as a computer-generated network, Ucinet networks, and Chinese rural-urban migrants' social networks, the algorithm can achieve higher modularity and greater speed than others in the recent literature.
| Original language | English |
|---|---|
| Pages (from-to) | 53-60 |
| Number of pages | 8 |
| Journal | Complexity |
| Volume | 12 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2007 |
Keywords
- Community structure
- Modularity
- Rural-urban migration
- Social network