Skip to main content

Part of the book series: Springer Theses ((Springer Theses))

  • 855 Accesses

Abstract

Although modularity has been one of the most frequently used methods the past decade, it suffers from some drawbacks. We will review these drawbacks here, and see whether the other methods reviewed in this thesis suffer from similar drawbacks. One of the most well-known problems is that of the resolution-limit, and we will introduce a more formal approach for studying this problem. We can use that to show that only few methods are actually able to overcome this issue.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Arenas A, Fernandez A, Gomez S (2007) Analysis of the structure of complex networks at different resolution levels. New J Phy 10(5):23. doi:10.1088/1367-2630/10/5/053039. arXiv:physics/0703218

  2. Bagrow J (2012) Communities and bottlenecks: trees and treelike networks have high modularity. Phys. Rev. E 85(6):9. doi:10.1103/PhysRevE.85.066118. arXiv:1201.0745

  3. Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M et al (2008) On modularity clustering. IEEE Trans Knowl Data Eng 20(2):172–188. doi:10.1109/TKDE.2007.190689

    Article  Google Scholar 

  4. Delvenne JC, Yaliraki SN, Barahona M (2010) Stability of graph communities across time scales. Proc Natl Acad Sci USA 107(29):12755–12760. doi:10.1073/pnas.0903215107

    Article  ADS  Google Scholar 

  5. Expert P, Evans TS, Blondel VD, Lambiotte R (2011) Uncovering space-independent communities in spatial networks. Proc Natl Acad Sci USA 108(19):7663–7668. doi:10.1073/pnas.1018962108. arXiv:1012.3409v1

  6. Krings G, Blondel VD (2011) An upper bound on community size in scalable community detection. arXiv:1103.5569

  7. Kumpula JM, Saramäki J, Kaski K, Kertész J (2007) Limited resolution in complex network community detection with Potts model approach. Eur Phys J B 56(1):41–45. doi:10.1140/epjb/e2007-00088-4

    Article  ADS  Google Scholar 

  8. Lambiotte R, Blondel VD, De Kerchove C, Huens E, Prieur C et al (2008) Geographical dispersal of mobile communication networks. Physica A 387(21):5317–5325. doi:10.1016/j.physa.2008.05.014

    Article  ADS  Google Scholar 

  9. Montgolfier FD, Soto M, Viennot L (2011) Asymptotic modularity of some graph classes. Lecture notes in computer science, vol 7074, pp 435–444. doi:10.1007/978-3-642-25591-5_45

  10. Newman M, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113. doi:10.1103/PhysRevE.69.026113

    Article  ADS  Google Scholar 

  11. Reichardt J, Bornholdt S (2006a) Statistical mechanics of community detection. Phys Rev E 74(1):016110. doi:10.1103/PhysRevE.74.016110

  12. Reichardt J, Bornholdt S (2006) When are networks truly modular? Physica D 224(1–2):20–26. doi:10.1016/j.physd.2006.09.009

    Article  ADS  MATH  MathSciNet  Google Scholar 

  13. Reichardt J, Bornholdt S (2007) Partitioning and modularity of graphs with arbitrary degree distribution. Phys Rev E 76(1):015102. doi:10.1103/PhysRevE.76.015102

    Article  ADS  MathSciNet  Google Scholar 

  14. Ronhovde P, Nussinov Z (2010) Local resolution-limit-free Potts model for community detection. Phys Rev E 81(4):046114. doi:10.1103/PhysRevE.81.046114. arXiv:0803.2548v4

  15. Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 105(4):1118–1123. doi:10.1073/pnas.0706851105

    Article  ADS  Google Scholar 

  16. Traag VA, Van Dooren P, Nesterov Y (2011) Narrow scope for resolution-limit-free community detection. Phys Rev E 84(1):016114. doi:10.1103/PhysRevE.84.016114. arXiv:1104.3083

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vincent Traag .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Traag, V. (2014). Scale Invariant Community Detection. In: Algorithms and Dynamical Models for Communities and Reputation in Social Networks. Springer Theses. Springer, Cham. https://doi.org/10.1007/978-3-319-06391-1_3

Download citation

Publish with us

Policies and ethics