Overlapping Communities in Bipartite Graphs

  • Radek MarikEmail author
  • Tomas Zikmund
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 812)


Community detection in bipartite networks with overlapping communities carries difficult problems when it comes to complex network analysis. In this paper, we propose a new model for generating such graphs. We combine several approaches based on stochastic block models using edge probabilities following the Poisson distribution. The proposed model can be reduced into their original model versions, such as a model for a bipartite graph with non-overlapping communities only. We present results of the generator. Its performance is evaluated using several known community detection techniques. The evaluation criterion assesses both a community’s identification and their overlaps.


Stochastic block model Bipartite graph Overlapping communities Graph generator 



Sponsored by the project for GAČR, No. 16-072105: Complex network methods applied to ancient Egyptian data in the Old Kingdom (2700–2180 BC).


  1. 1.
    Ball, B., Karrer, B., Newman, M.E.J.: An efficient and principled method for detecting communities in networks. CoRR abs/1104.3590 (2011).
  2. 2.
    Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks (2009).
  3. 3.
    Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10,008 (2008)CrossRefGoogle Scholar
  4. 4.
    Du, N., Wang, B., Wu, B., Wang, Y.: Overlapping community detection in bipartite networks. In: 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, vol. 1, pp. 176–179 (2008).
  5. 5.
    Dulíková, V.: The reign of king Nyuserre and its impact on the development of the Egyptian state. A multiplier effect period during the Old Kingdom. Ph.D. thesis, Charles University in Prague, Faculty of Arts, Czech Institute of Egyptology (2016)Google Scholar
  6. 6.
    Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010). Scholar
  7. 7.
    Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129–1164 (1991). Scholar
  8. 8.
    Heeger, D.: Poisson model of spike generation (2000).
  9. 9.
    Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Netw. 5(2), 109–137 (1983). Scholar
  10. 10.
    Karrer, B., Newman, M.E.J.: Stochastic blockmodels and community structure in networks. Phys. Rev. E 83, 016,107 (2011). Scholar
  11. 11.
    Larremore, D.B., Clauset, A., Jacobs, A.Z.: Efficiently inferring community structure in bipartite networks. CoRR abs/1403.2933 (2014).
  12. 12.
    Lehmann, S., Schwartz, M., Hansen, L.K.: Biclique communities. Phys. Rev. E 78, 016,108 (2008).
  13. 13.
    Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026,113+ (2003). Scholar
  14. 14.
    Yan, X., et al.: Model selection for degree-corrected block models. J. Stat. Mech. Theory Exp. 2014(5), P05,007 (2014)Google Scholar
  15. 15.
    Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 587–596. ACM (2013)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Czech Technical University in PraguePragueCzech Republic
  2. 2.Czech Technical University in PraguePragueCzech Republic

Personalised recommendations