Abstract A network is said to have the properties of a small world if suitably defined average distance between any two nodes proportional logarithm number nodes, N . In this paper, we present novel derivation small-world property for Gilbert–Erdös–Renyi random networks. We employ mean field approximation that permits analytic distribution shortest paths exhibits logarithmic scaling away from p...