Journal of Applied Mathematics

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

Guoyong Mao and Ning Zhang

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

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.

Article information

Source
J. Appl. Math., Volume 2014 (2014), Article ID 154172, 6 pages.

Dates
First available in Project Euclid: 2 March 2015

Permanent link to this document
https://projecteuclid.org/euclid.jam/1425305813

Digital Object Identifier
doi:10.1155/2014/154172

Mathematical Reviews number (MathSciNet)
MR3219416

Citation

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


Export citation

References

  • R. Albert, H. Jeong, and A.-L. Barabási, “Diameter of the world-wide web,” Nature, vol. 401, no. 6749, pp. 130–131, 1999.
  • A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999.
  • R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol. 74, no. 1, pp. 47–91, 2002.
  • D. J. Watts and S. H. Strogatz, “Collective dynamics of “small-world” networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.
  • A.-L. Barabási, R. Albert, and H. Jeong, “Mean-field theory for scale-free random networks,” Physica A: Statistical Mechanics and Its Applications, vol. 272, no. 1, pp. 173–187, 1999.
  • X. F. Wang and G. Chen, “Complex networks: small-world, scale-free and beyond,” IEEE Circuits and Systems Magazine, vol. 3, no. 1, pp. 6–20, 2003.
  • E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269–271, 1959.
  • K. Madduri, D. A. Bader, W. B. Jonathan, and J. R. Crobak, “An experimental study of a parallel shortest path algorithm for solving large-scale graph instances,” in Proceedings of the 9th Workshop on Algorithm Engineering and Experiments, pp. 23–35, New Orleans, La, USA, January 2007.
  • G. Mao and N. Zhang, “Analysis of average shortest-path length of scale-free network,” Journal of Applied Mathematics, vol. 2013, Article ID 865643, 5 pages, 2013.
  • N. Zhang, “Demonstration of complex network: CERNET,” Journal of Systems Engineering, vol. 21, no. 4, pp. 337–340, 2006.
  • G. Mao and N. Zhang, “Study of evolution model of China education and research network,” Mathematical Problem in Engineering, vol. 2013, Article ID 808901, 6 pages, 2013. \endinput