Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We are aware of the trivial case in which each vertex is assigned to its own community and is assessed as the best detection.
References
Ball, B., Karrer, B., Newman, M.E.J.: An efficient and principled method for detecting communities in networks. CoRR abs/1104.3590 (2011). http://arxiv.org/abs/1104.3590
Bastian, M., Heymann, S., Jacomy, M.: Gephi: an open source software for exploring and manipulating networks (2009). http://www.aaai.org/ocs/index.php/ICWSM/09/paper/view/154
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)
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). https://doi.org/10.1109/WIIAT.2008.98
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)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010). https://doi.org/10.1016/j.physrep.2009.11.002
Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129–1164 (1991). https://doi.org/10.1002/spe.4380211102
Heeger, D.: Poisson model of spike generation (2000). http://www.cns.nyu.edu/~david/handouts/poisson.pdf
Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Netw. 5(2), 109–137 (1983). https://doi.org/10.1016/0378-8733(83)90021-7
Karrer, B., Newman, M.E.J.: Stochastic blockmodels and community structure in networks. Phys. Rev. E 83, 016,107 (2011). https://doi.org/10.1103/PhysRevE.83.016107
Larremore, D.B., Clauset, A., Jacobs, A.Z.: Efficiently inferring community structure in bipartite networks. CoRR abs/1403.2933 (2014). http://arxiv.org/abs/1403.2933
Lehmann, S., Schwartz, M., Hansen, L.K.: Biclique communities. Phys. Rev. E 78, 016,108 (2008). https://doi.org/10.1103/PhysRevE.78.016108. https://link.aps.org/doi/10.1103/PhysRevE.78.016108
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026,113+ (2003). https://doi.org/10.1103/physreve.69.026113
Yan, X., et al.: Model selection for degree-corrected block models. J. Stat. Mech. Theory Exp. 2014(5), P05,007 (2014)
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)
Acknowledgement
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).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Marik, R., Zikmund, T. (2019). Overlapping Communities in Bipartite Graphs. In: Aiello, L., Cherifi, C., Cherifi, H., Lambiotte, R., Lió, P., Rocha, L. (eds) Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 812. Springer, Cham. https://doi.org/10.1007/978-3-030-05411-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-05411-3_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05410-6
Online ISBN: 978-3-030-05411-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)