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

Extraction algorithm for optimal coarse-grained networks on complex networks

Author

Listed:
  • Lang Zeng

    (College of Science, Guilin University of Technology, Guilin 541006, P. R. China)

  • Zhen Jia

    (College of Science, Guilin University of Technology, Guilin 541006, P. R. China)

  • Yingying Wang

    (College of Science, Guilin University of Technology, Guilin 541006, P. R. China)

Abstract

Coarse-graining of complex networks is a hot topic in network science. Coarse-grained networks are required to preserve the topological information or dynamic properties of the original network. Some effective coarse-graining methods have been proposed, while an urgent problem is how to obtain coarse-grained network with optimal scale. In this paper, we propose an extraction algorithm (EA) for optimal coarse-grained networks. Numerical simulation for EA on four kinds of networks and performing Kuramoto model on optimal coarse-grained networks, we find our algorithm can effectively obtain the optimal coarse-grained network.

Suggested Citation

  • Lang Zeng & Zhen Jia & Yingying Wang, 2019. "Extraction algorithm for optimal coarse-grained networks on complex networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 30(11), pages 1-11, November.
    • Handle: RePEc:wsi:ijmpcx:v:30:y:2019:i:11:n:s0129183119500815
    DOI: 10.1142/S0129183119500815
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183119500815
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183119500815?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:30:y:2019:i:11:n:s0129183119500815. 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.