Welcome to the InfoSci Platform
Random Node Pair Sampling-Based Estimation of Average Path Lengths in Networks

Random Node Pair Sampling-Based Estimation of Average Path Lengths in Networks

Luis E. Castro, Nazrul I. Shaikh
Copyright: © 2018 |Volume: 9 |Issue: 3 |Pages: 25
ISSN: 1947-9328|EISSN: 1947-9336|EISBN13: 9781522544623|DOI: 10.4018/IJORIS.2018070102
Cite Article Cite Article

MLA

Castro, Luis E., and Nazrul I. Shaikh. "Random Node Pair Sampling-Based Estimation of Average Path Lengths in Networks." IJORIS vol.9, no.3 2018: pp.27-51. http://doi.org/10.4018/IJORIS.2018070102

APA

Castro, L. E. & Shaikh, N. I. (2018). Random Node Pair Sampling-Based Estimation of Average Path Lengths in Networks. International Journal of Operations Research and Information Systems (IJORIS), 9(3), 27-51. http://doi.org/10.4018/IJORIS.2018070102

Chicago

Castro, Luis E., and Nazrul I. Shaikh. "Random Node Pair Sampling-Based Estimation of Average Path Lengths in Networks," International Journal of Operations Research and Information Systems (IJORIS) 9, no.3: 27-51. http://doi.org/10.4018/IJORIS.2018070102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This article describes how the average path length (APL) of a network is an important metric that provides insights on the interconnectivity in a network and how much time and effort would be required for search and navigation on that network. However, the estimation of APL is time-consuming as its computational complexity scales nonlinearly with the network size. In this article, the authors develop a computationally efficient random node pair sampling algorithm that enables the estimation of APL with a specified precision and confidence. The proposed sampling algorithms provide a speed-up factor ranging from 240-750 for networks with more than 100,000 nodes. The authors also find that the computational time required for estimation APL does not necessarily increase with the network size; it shows an inverted U shape instead.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.