Journal of Applied Mathematics
- J. Appl. Math.
- Volume 2014 (2014), Article ID 154172, 6 pages.
A Multilevel Simplification Algorithm for Computing the Average Shortest-Path Length of Scale-Free Complex Network
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.
J. Appl. Math., Volume 2014 (2014), Article ID 154172, 6 pages.
First available in Project Euclid: 2 March 2015
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Mao, Guoyong; Zhang, Ning. A Multilevel Simplification Algorithm for Computing the Average Shortest-Path Length of Scale-Free Complex Network. J. Appl. Math. 2014 (2014), Article ID 154172, 6 pages. doi:10.1155/2014/154172. https://projecteuclid.org/euclid.jam/1425305813