Community Detection Based on Variable Vertex Influence

In recent years community detection has been a hot research topic in network science, which helps to explain the characteristics of the network structure. This paper analyzed the effect of vertices with high influence in community detection, and found that such vertices have different roles in different networks. A variable influence community detection algorithm based on PageRank is proposed in this paper, which can resize the community involving vertices with high influence. A variable influence local community detection algorithm based on a single initial vertex is also proposed, which introduces the mechanism of influence decay and is able to find communities with different sizes according to users' requirements.

[1]  Marko Bajec,et al.  Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[4]  Pietro Liò,et al.  Towards real-time community detection in large networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  William Nick Street,et al.  A novel algorithm for community detection and influence ranking in social networks , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[6]  Jure Leskovec,et al.  Defining and Evaluating Network Communities Based on Ground-Truth , 2012, ICDM.

[7]  Himel Dev A user interaction based community detection algorithm for online social networks , 2014, SIGMOD Conference.

[8]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Philip S. Yu,et al.  Community detection in incomplete information networks , 2012, WWW.

[10]  Chen Li,et al.  Community detection in complex networks by density-based clustering , 2013 .

[11]  M. Newman Communities, modules and large-scale structure in networks , 2011, Nature Physics.

[12]  Wei Hu,et al.  Finding Statistically Significant Communities in Networks with Weighted Label Propagation , 2013 .

[13]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[14]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[15]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[16]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[17]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  J. Brown Behavioral Ecology and Sociobiology , 2019, Encyclopedia of Animal Behavior.

[19]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Robin Wilson,et al.  Modern Graph Theory , 2013 .

[21]  M. Barber,et al.  Detecting network communities by propagating labels under constraints. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[23]  Martin Rosvall,et al.  An information-theoretic framework for resolving community structure in complex networks , 2007, Proceedings of the National Academy of Sciences.

[24]  Hao Lou,et al.  Detecting community structure using label propagation with weighted coherent neighborhood propinquity , 2013 .

[25]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[26]  Michal Laclavik,et al.  On community detection in real-world networks and the importance of degree assortativity , 2013, KDD.

[27]  E. Barnes An algorithm for partitioning the nodes of a graph , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[28]  Philip S. Yu,et al.  Hierarchical, Parameter-Free Community Discovery , 2008, ECML/PKDD.

[29]  Jian Li,et al.  Scalable community detection in massive social networks using MapReduce , 2013, IBM J. Res. Dev..

[30]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[32]  Marko Bajec,et al.  Robust network community detection using balanced propagation , 2011, ArXiv.

[33]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

[34]  John E. Hopcroft,et al.  On the separability of structural classes of communities , 2012, KDD.

[35]  Ru Zhang,et al.  An improved algorithm for community discovery in social networks based on label propagation , 2015, 2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD).