An improved algorithm for generalized community structure inference in complex networks

In recent years, the research of the community detection is not only on the structure that densely connected internally, but also on the structure of more patterns, such as heterogeneity, overlapping, core–periphery. In this paper, we build the network model based on the random graph models and propose an improved algorithm to infer the generalized community structures. We achieve it by introducing the generalized Bernstein polynomials and computing the latent parameters of vertices. The algorithm is tested both on the computer-generated benchmark networks and the real-world networks. Results show that the algorithm makes better performances on convergence speed and is able to discover the latent continuous structures in networks.

[1]  Zai-En Hou,et al.  Approximation of multivariate function by using new multivariate Bernstein alpha-polynomials , 2004, Appl. Math. Comput..

[2]  Hui-Jia Li,et al.  Social significance of community structure: Statistical view , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Mark E. J. Newman,et al.  Generalized communities in networks , 2015, Physical review letters.

[4]  Xiao Zhang,et al.  Identification of core-periphery structure in networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[6]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

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

[8]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[9]  Mark E. J. Newman,et al.  Spectral methods for network community detection and graph partitioning , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Cristopher Moore,et al.  Phase transition in the detection of modules in sparse networks , 2011, Physical review letters.

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

[12]  Mingyuan Zhou Discussion on "Sparse graphs using exchangeable random measures" by Francois Caron and Emily B. Fox , 2018 .

[13]  Aihua Li,et al.  Fast and Accurate Mining the Community Structure: Integrating Center Locating and Membership Optimization , 2016, IEEE Transactions on Knowledge and Data Engineering.

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

[15]  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.

[16]  Jean-Charles Delvenne,et al.  Stability of graph communities across time scales , 2008, Proceedings of the National Academy of Sciences.

[17]  Weiren Shi,et al.  Inferring overlapping community structure with degree-corrected block model , 2015 .

[18]  Mark Newman,et al.  Networks: An Introduction , 2010 .