Skip to main content

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

  • 841 Accesses

Abstract

Some multi-resolution methods may be able to overcome the issue of the resolution-limit. Nonetheless, it remains difficult to find “meaningful” or “good” resolution values. In addition, it is not always clear whether the observed partition is really different from what can be observed in a random graph. We here introduce the notion of the significance of a partition. We show that it is able to uncover “meaningful” resolution values, and works well in benchmarks.

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. Aldecoa R, Marín I (2011) Deciphering network community structure by surprise. PLoS One 6(9):e24195. doi:10.1371/journal.pone.0024195

    Article  Google Scholar 

  2. Aldecoa R, Marín I (2013) Surprise maximization reveals the community structure of complex networks. Sci Rep 3:1060. doi:10.1038/srep01060

    ADS  Google Scholar 

  3. Cover TM, Thomas JA (2012) Elements of information theory. Wiley, London. ISBN 1118585771

    Google Scholar 

  4. Delvenne JC, Yaliraki SN, Barahona M (2010) Stability of graph communities across time scales. In: Proceedings of the National Academy of Sciences of the United States of America 107(29):12755–12760. doi:10.1073/pnas.0903215107

    Google Scholar 

  5. Krings G (2012) Extraction of information from large networks. Ph.D. thesis, Université catholique de Louvain, Belgium

    Google Scholar 

  6. Mirshahvalad A, Lindholm J, Derlén M, Rosvall M (2012) Significant communities in large sparse networks. PloS one 7(3):e33721. doi:10.1371/journal.pone.0033721. arXiv: 1110.0305

    Google Scholar 

  7. Mucha PJ, Richardson T, Macon K, Porter MA, Onnela JP (2010) Community structure in time-dependent, multiscale, and multiplex networks. Science (NY) 328(5980):876–978. doi:10.1126/science.1184819. arXiv: 0911.1824

    Google Scholar 

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

    Article  ADS  MATH  MathSciNet  Google Scholar 

  9. Ronhovde P, Nussinov Z (2009) Multiresolution community detection for megascale networks by information-based replica correlations. Phys Rev E 80(1):016109. doi:10.1103/PhysRevE.80.016109

    Article  ADS  Google Scholar 

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). Finding Significant Resolutions. 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_4

Download citation

Publish with us

Policies and ethics