Skip to main content
SpringerLink
Log in

Community Detection via Neighborhood Overlap and Spanning Tree Computations

  • Conference paper
  • First Online:
Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11409))

Included in the following conference series:

Abstract

Most social networks of today are populated with several millions of active users, while the most popular of them accommodate way more than one billion. Analyzing such huge complex networks has become particularly demanding in computational terms. A task of paramount importance for understanding the structure of social networks as well as of many other real-world systems is to identify communities, that is, sets of nodes that are more densely connected to each other than to other nodes of the network. In this paper we propose two algorithms for community detection in networks, by employing the neighborhood overlap metric and appropriate spanning tree computations.

The order of authors is alphabetical; each author had an equal contribution to this work.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note that the plain Louvain algorithm, can be applied on unweighted graphs by setting all edge weights equal to 1.

References

  1. Facebook (nips) network dataset - KONECT, April 2017. http://konect.uni-koblenz.de/networks/ego-facebook

  2. Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(9), 761–764 (2010)

    Article  Google Scholar 

  3. Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  5. Danon, L., Díaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech. Theory Exp. 2005(09), 09008 (2005)

    Article  Google Scholar 

  6. Erdös, P., Rényi, A.: On random graphs I. Publicationes Mathematicae Debrecen 6, 290 (1959)

    MathSciNet  MATH  Google Scholar 

  7. Fortunato, S., Barthelemy, M.: Resolution limit in community detection. Proc. Nat. Acad. Sci. 104(1), 36–41 (2007)

    Article  Google Scholar 

  8. Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99(12), 7821–7826 (2002)

    Article  MathSciNet  Google Scholar 

  9. Liakos, P., Ntoulas, A., Delis, A.: Scalable link community detection: a local dispersion-aware approach. In: IEEE International Conference on Big Data, pp. 716–725 (2016)

    Google Scholar 

  10. Liakos, P., Ntoulas, A., Delis, A.: COEUS: community detection via seed-set expansion on graph streams. In: IEEE International Conference on Big Data, pp. 676–685 (2017)

    Google Scholar 

  11. McAuley, J., Leskovec, J.: Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems, pp. 548–556 (2012)

    Google Scholar 

  12. Meghanathan, N.: A greedy algorithm for neighborhood overlap-based community detection. Algorithms 9(1), 8 (2016)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  14. Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)

    Article  Google Scholar 

  15. Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Phys. Rev. E 74, 016110 (2006)

    Article  MathSciNet  Google Scholar 

  16. Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: 6th ACM WSDM 2013, pp. 587–596 (2013)

    Google Scholar 

  17. Yin, H., Benson, A.R., Leskovec, J., Gleich, D.F.: Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD, pp. 555–564 (2017)

    Google Scholar 

  18. Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452–473 (1977)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. San Jose State University, One Washington Square, San Jose, CA, 95192, USA

    Ketki Kulkarni & Katerina Potika

  2. School of Electrical and Computer Engineering, National Technical University of Athens, 15780, Zografou, Greece

    Aris Pagourtzis, Petros Potikas & Dora Souliou

Authors
  1. Ketki Kulkarni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aris Pagourtzis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Katerina Potika
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Petros Potikas
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Dora Souliou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aris Pagourtzis .

Editor information

Editors and Affiliations

  1. Technical University of Darmstadt, Darmstadt, Germany

    Yann Disser

  2. Hellenic Open University, Patras, Greece

    Vassilios S. Verykios

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kulkarni, K., Pagourtzis, A., Potika, K., Potikas, P., Souliou, D. (2019). Community Detection via Neighborhood Overlap and Spanning Tree Computations. In: Disser, Y., Verykios, V. (eds) Algorithmic Aspects of Cloud Computing. ALGOCLOUD 2018. Lecture Notes in Computer Science(), vol 11409. Springer, Cham. https://doi.org/10.1007/978-3-030-19759-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-19759-9_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-19758-2

  • Online ISBN: 978-3-030-19759-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation