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

Guoyong Mao and Ning Zhang

Journal of Applied Mathematics, 2014, vol. 2014, issue 1

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.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/154172

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2014:y:2014:i:1:n:154172

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().