IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v66y2013i3p331-336.html
   My bibliography  Save this article

A general view on computing communities

Author

Listed:
  • Olsen, Martin

Abstract

We define a community structure of a graph as a partition of the vertices into at least two sets with the property that each vertex has connections to relatively many vertices in its own set compared to any other set in the partition and refer to the sets in such a partition as communities. We show that it is NP-hard to compute a community containing a given set of vertices. On the other hand, we show how to compute a community structure in polynomial time for any connected graph containing at least four vertices except the star graph Sn. Finally, we generalize our results and formally show that counterintuitive aspects are unavoidable for any definition of a community structure with a polynomial time algorithm for computing communities containing specific vertices.

Suggested Citation

  • Olsen, Martin, 2013. "A general view on computing communities," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 331-336.
    • Handle: RePEc:eee:matsoc:v:66:y:2013:i:3:p:331-336
    DOI: 10.1016/j.mathsocsci.2013.07.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489613000668
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2013.07.002?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Aaron Clauset & Cristopher Moore & M. E. J. Newman, 2008. "Hierarchical structure and the prediction of missing links in networks," Nature, Nature, vol. 453(7191), pages 98-101, May.
    2. Guimera, R. & Danon, L. & Diaz-Guilera, A. & Giralt, F. & Arenas, A., 2006. "The real communication network behind the formal chart: Community structure in organizations," Journal of Economic Behavior & Organization, Elsevier, vol. 61(4), pages 653-667, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yao Hongxing & Lu Yunxia, 2017. "Analyzing the Potential Influence of Shanghai Stock Market Based on Link Prediction Method," Journal of Systems Science and Information, De Gruyter, vol. 5(5), pages 446-461, October.
    2. Gergely Tibély & David Sousa-Rodrigues & Péter Pollner & Gergely Palla, 2016. "Comparing the Hierarchy of Keywords in On-Line News Portals," PLOS ONE, Public Library of Science, vol. 11(11), pages 1-15, November.
    3. Ding, Ying, 2011. "Community detection: Topological vs. topical," Journal of Informetrics, Elsevier, vol. 5(4), pages 498-514.
    4. Gräbner, Claudius, 2016. "From realism to instrumentalism - and back? Methodological implications of changes in the epistemology of economics," MPRA Paper 71933, University Library of Munich, Germany.
    5. Liu, Chuang & Zhou, Wei-Xing, 2012. "Heterogeneity in initial resource configurations improves a network-based hybrid recommendation algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(22), pages 5704-5711.
    6. Tamás Nepusz & Tamás Vicsek, 2013. "Hierarchical Self-Organization of Non-Cooperating Individuals," PLOS ONE, Public Library of Science, vol. 8(12), pages 1-9, December.
    7. Xia, Yongxiang & Pang, Wenbo & Zhang, Xuejun, 2021. "Mining relationships between performance of link prediction algorithms and network structure," Chaos, Solitons & Fractals, Elsevier, vol. 153(P2).
    8. Kai Riemer & Stefan Stieglitz & Christian Meske, 2015. "From Top to Bottom," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 57(3), pages 197-212, June.
    9. Nora Connor & Albert Barberán & Aaron Clauset, 2017. "Using null models to infer microbial co-occurrence networks," PLOS ONE, Public Library of Science, vol. 12(5), pages 1-23, May.
    10. Aslan, Serpil & Kaya, Buket & Kaya, Mehmet, 2019. "Predicting potential links by using strengthened projections in evolving bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 525(C), pages 998-1011.
    11. Leto Peel & Tiago P. Peixoto & Manlio De Domenico, 2022. "Statistical inference links data and theory in network science," Nature Communications, Nature, vol. 13(1), pages 1-15, December.
    12. Xinyi Liu & Bin Liu & Zhimin Huang & Ting Shi & Yingyi Chen & Jian Zhang, 2012. "SPPS: A Sequence-Based Method for Predicting Probability of Protein-Protein Interaction Partners," PLOS ONE, Public Library of Science, vol. 7(1), pages 1-6, January.
    13. Rosanna Grassi & Paolo Bartesaghi & Stefano Benati & Gian Paolo Clemente, 2021. "Multi-Attribute Community Detection in International Trade Network," Networks and Spatial Economics, Springer, vol. 21(3), pages 707-733, September.
    14. Amulyashree Sridhar & Sharvani GS & AH Manjunatha Reddy & Biplab Bhattacharjee & Kalyan Nagaraj, 2019. "The Eminence of Co-Expressed Ties in Schizophrenia Network Communities," Data, MDPI, vol. 4(4), pages 1-23, November.
    15. Li, Qing & Zhang, Huaige & Hong, Xianpei, 2020. "Knowledge structure of technology licensing based on co-keywords network: A review and future directions," International Review of Economics & Finance, Elsevier, vol. 66(C), pages 154-165.
    16. Wang, Zuxi & Wu, Yao & Li, Qingguang & Jin, Fengdong & Xiong, Wei, 2016. "Link prediction based on hyperbolic mapping with community structure for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 609-623.
    17. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    18. Thorben Funke & Till Becker, 2019. "Stochastic block models: A comparison of variants and inference methods," PLOS ONE, Public Library of Science, vol. 14(4), pages 1-40, April.
    19. Kan, Kees-Jan & van der Maas, Han L.J. & Levine, Stephen Z., 2019. "Extending psychometric network analysis: Empirical evidence against g in favor of mutualism?," Intelligence, Elsevier, vol. 73(C), pages 52-62.
    20. Shang, Ke-ke & Small, Michael & Yan, Wei-sheng, 2017. "Link direction for link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 767-776.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:66:y:2013:i:3:p:331-336. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.