Open Access
Translator Disclaimer
2014 A Multilevel Simplification Algorithm for Computing the Average Shortest-Path Length of Scale-Free Complex Network
Guoyong Mao, Ning Zhang
J. Appl. Math. 2014: 1-6 (2014). DOI: 10.1155/2014/154172

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.

Citation

Download Citation

Guoyong Mao. Ning Zhang. "A Multilevel Simplification Algorithm for Computing the Average Shortest-Path Length of Scale-Free Complex Network." J. Appl. Math. 2014 1 - 6, 2014. https://doi.org/10.1155/2014/154172

Information

Published: 2014
First available in Project Euclid: 2 March 2015

zbMATH: 07131360
MathSciNet: MR3219416
Digital Object Identifier: 10.1155/2014/154172

Rights: Copyright © 2014 Hindawi

JOURNAL ARTICLE
6 PAGES


SHARE
Vol.2014 • 2014
Back to Top