IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2014y2014i1n154172.html

A Multilevel Simplification Algorithm for Computing the Average Shortest‐Path Length of Scale‐Free Complex Network

Author

Listed:
  • Guoyong Mao
  • Ning Zhang

Abstract

Computing the average shortest‐path length (ASPL) of a large scale‐free network needs much memory space and computation time. Based on the feature of scale‐free network, we present a simplification algorithm by cutting the suspension points and the connected edges; the ASPL of the original network can be computed through that of the simplified network. We also present a multilevel simplification algorithm to get ASPL of the original network directly from that of the multisimplified network. Our experiment shows that these algorithms require less memory space and time in computing the ASPL of scale‐free network, which makes it possible to analyze large networks that were previously impossible due to memory limitations.

Suggested Citation

  • Guoyong Mao & Ning Zhang, 2014. "A Multilevel Simplification Algorithm for Computing the Average Shortest‐Path Length of Scale‐Free Complex Network," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    • Handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:154172
    DOI: 10.1155/2014/154172
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/154172
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/154172?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
    ---><---

    References listed on IDEAS

    as
    1. Guoyong Mao & Ning Zhang, 2013. "Analysis of Average Shortest-Path Length of Scale-Free Network," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-5, July.
    2. Guoyong Mao & Ning Zhang, 2013. "Analysis of Average Shortest‐Path Length of Scale‐Free Network," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    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. Nickie Lefevr & Andreas Kanavos & Vassilis C. Gerogiannis & Lazaros Iliadis & Panagiotis Pintelas, 2021. "Employing Fuzzy Logic to Analyze the Structure of Complex Biological and Epidemic Spreading Models," Mathematics, MDPI, vol. 9(9), pages 1-23, April.
    2. Dongin Nam & Jiwon Kim & Jeeyoung Yoon & Chaemin Song & Seongdeok Kim & Min Song, 2024. "Examining knowledge entities and its relationships based on citation sentences using a multi-anchor bipartite network," Scientometrics, Springer;Akadémiai Kiadó, vol. 129(11), pages 7197-7228, November.

    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:wly:jnljam:v:2014:y:2014:i:1:n:154172. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.