Determining efficiency of small–world algorithms: A comparative approach

Abstract In this paper, a comparison between three small–world algorithms is performed. Fixed–size complex networks are used to investigate efficiency of small–world property promoting synchronization. Cooperative behavior is determined through its transition point to the synchronized state. The presence of different types of synchronization characterizes the efficiency of the algorithms. Non–linear systems that exhibit chaos are used to compose the complex networks.