Local K-Core Algorithm in Complex Networks
Lu Chen · OhioLink ETD Center (Ohio Library and Information Network) · 2013
Local methods tend to be more effective for community definition and detection than those difficult and large time consuming global ones.In this thesis, we introduce and define the notion of local k-core; a simpler local method easily implemented and computed which is based on the knowledge of neighborhood graph of the vertices in the graph.From the definition, we present the localized algorithm for local k-core decomposition algorithm.We show its relationship with 3-clique percolation and the kcore algorithm.Finally our experiment results reveal the efficiency of the algorithm and the richer community structure it exposed in real networks.iii