SGPD Volume Maximization for Community Detection
arXiv:1511.01523
Abstract
In this note we briefly study the feasibility of community detection in complex networks using peripheral vertices. Our method suggests a novel direction in axiomizing the problem of clustering in graphs and complex networks by looking at the topological role each vertex plays in the community structure, regardless of the attributes. The promising strength of pseudo-peripheral vertices as a lever for analysis of complex networks is also demonstrated on real-world data.
References in corpus (9)
- Emergence of scaling in random networks
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Finding community structure in very large networks
- Fast algorithm for detecting community structure in networks
- Community detection algorithms: a comparative analysis
- Statistical Mechanics of Community Detection
- Friendship and Natural Selection