Skip to main content

Community Detection for Temporal Weighted Bipartite Networks

  • Conference paper
  • First Online:
Complex Networks and Their Applications XI (COMPLEX NETWORKS 2016 2022)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 1078))

Included in the following conference series:

  • 1660 Accesses

Abstract

Community detection of temporal (time-evolving) bipartite networks is challenging because it can be performed either on the temporal bipartite network, or on various projected networks, composed of only one type of nodes, via diverse community detection algorithms. In this paper, we aim to systematically design detection methods addressing both network choices and community detection algorithms, and to compare the community structures detected by different methods. We illustrate our methodology by using a telecommunications network as an example. We find that three methods proposed identify evident community structures: one is performed on each snapshot of the temporal network, and the other two, in temporal projections. We characterise the community structures detected by each method by an evaluation network in which the nodes are the services of the telecommunications network, and the weight of the links between them are the number of snapshots that both services were assigned to the same community. Analysing the evaluation networks of the three methods reveals the similarity and difference among these methods in identifying common node pairs or groups of nodes that often belong to the same community. We find that the two methods that are based on the same projected network identify consistent community structures, whereas the method based on the original temporal bipartite network complements this vision of the community structure. Moreover, we found a non-trivial number of node pairs that belong consistently to the same community in all the methods applied.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aynaud, T., Guillaume, J.: Static community detection algorithms for evolving networks. In: 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, pp. 513–519 (2010)

    Google Scholar 

  2. Barber, M.: Modularity and community detection in bipartite networks. Phys. Rev. E. 76, 066102 (2007)

    Article  Google Scholar 

  3. Blondel, V., Guillaume, J., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp., P10008 (2008)

    Google Scholar 

  4. Delvenne, J., Yaliraki, S., Barahona, M.: Stability of graph communities across time scales. Proc. Nat. Acad. Sci. 107, 12755–12760 (2010)

    Article  Google Scholar 

  5. Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)

    Article  Google Scholar 

  6. Ge, X., Wang, H.: Community overlays upon real-world complex networks. Eur. Phys. J. B 85, 26 (2012)

    Article  Google Scholar 

  7. Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E. 69, 026113 (2004)

    Article  Google Scholar 

  8. Newman, M.: Fast algorithm for detecting community structure in networks. Phys. Rev. E. 69, 066133 (2004)

    Article  Google Scholar 

  9. Newman, M.: Modularity and community structure in networks. Proc. Nat. Acad. Sci. 103, 8577–8582 (2006)

    Article  Google Scholar 

  10. Newman, M.: Networks: An Introduction. Oxford University Press (2010)

    Google Scholar 

  11. Peters, L., Cai, J., Wang, H.: Characterizing temporal bipartite networks—sequential- versus cross-tasking. Complex Netw. Appl. VII 28–9 (2019)

    Google Scholar 

  12. Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Proc. Nat. Acad. Sci. 101, 2658–2663 (2004)

    Google Scholar 

  13. Rossetti, G., Cazabet, R.: Community discovery in dynamic networks: a survey. ACM Comput. Surv. 51 (2018)

    Google Scholar 

  14. Zhou, C., Feng, L., Zhao, Q.: A novel community detection method in bipartite networks. Phys. A Stat. Mech. Appl. 492, 1679–1693 (2018)

    Article  Google Scholar 

Download references

Acknowledgements

We thank NExTWORKx, a collaboration between TU Delft and KPN on future telecommunication networks, for the support.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huijuan Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Robledo, O.F., Klepper, M., Boven, E.v., Wang, H. (2023). Community Detection for Temporal Weighted Bipartite Networks. In: Cherifi, H., Mantegna, R.N., Rocha, L.M., Cherifi, C., Micciche, S. (eds) Complex Networks and Their Applications XI. COMPLEX NETWORKS 2016 2022. Studies in Computational Intelligence, vol 1078. Springer, Cham. https://doi.org/10.1007/978-3-031-21131-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-21131-7_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-21130-0

  • Online ISBN: 978-3-031-21131-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics