IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v26y2015i08ns0129183115500916.html
   My bibliography  Save this article

A novel dynamical community detection algorithm based on weighting scheme

Author

Listed:
  • Ju Li

    (School of Computer Science and Engineering, Changshu Institute of Technology, Changshu, Jiangsu 215500, P. R. China;
    VCC Division, School of Computer and Information, Hefei University of Technology, Hefei, Anhu 230009, P. R. China)

  • Kai Yu

    (School of Computer Science and Engineering, Xinjiang University of Finance & Economics, Urumqi, Xinjiang 830012, P. R. China)

  • Ke Hu

    (Department of Physics, Xiangtan University, Xiangtan, Hunan 411105, P. R. China)

Abstract

Network dynamics plays an important role in analyzing the correlation between the function properties and the topological structure. In this paper, we propose a novel dynamical iteration (DI) algorithm, which incorporates the iterative process of membership vector with weighting scheme, i.e. weightingWand tightnessT. These new elements can be used to adjust the link strength and the node compactness for improving the speed and accuracy of community structure detection. To estimate the optimal stop time of iteration, we utilize a new stability measure which is defined as the Markov random walk auto-covariance. We do not need to specify the number of communities in advance. It naturally supports the overlapping communities by associating each node with a membership vector describing the node's involvement in each community. Theoretical analysis and experiments show that the algorithm can uncover communities effectively and efficiently.

Suggested Citation

  • Ju Li & Kai Yu & Ke Hu, 2015. "A novel dynamical community detection algorithm based on weighting scheme," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 26(08), pages 1-17.
    • Handle: RePEc:wsi:ijmpcx:v:26:y:2015:i:08:n:s0129183115500916
    DOI: 10.1142/S0129183115500916
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183115500916
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183115500916?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.

    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:wsi:ijmpcx:v:26:y:2015:i:08:n:s0129183115500916. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.