IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v390y2011i21p4027-4033.html
   My bibliography  Save this article

The effect of hub nodes on the community structure in scale-free networks

Author

Listed:
  • Wang, Yang
  • Hu, Yanqing
  • Di, Zengru
  • Fan, Ying

Abstract

Many networks have two important features in common (1) the scale-free degree distribution P(k)∝k−α and (2) the community structure. In this paper, we focus on the relationship between these two features in complex networks. We first investigate the effect of the power law exponent α on the community structure in artificial networks and some real-world networks. Generally speaking, we find out that the networks with significant community structure, often have a large α. Second, hub nodes removal from scale-free networks affects the community structure more considerably than random removal. Our observation indicates that hubs may be the explanation for that scale-free networks often have fuzzy community structure.

Suggested Citation

  • Wang, Yang & Hu, Yanqing & Di, Zengru & Fan, Ying, 2011. "The effect of hub nodes on the community structure in scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(21), pages 4027-4033.
  • Handle: RePEc:eee:phsmap:v:390:y:2011:i:21:p:4027-4033
    DOI: 10.1016/j.physa.2011.06.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843711100478X
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2011.06.031?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yang, Qing-Lin & Wang, Li-Fu & Zhao, Guo-Tao & Guo, Ge, 2020. "A coarse graining algorithm based on m-order degree in complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 558(C).
    2. Long, Yong-Shang & Jia, Zhen & Wang, Ying-Ying, 2018. "Coarse graining method based on generalized degree in complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 505(C), pages 655-665.

    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:phsmap:v:390:y:2011:i:21:p:4027-4033. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.