A Quality and Cost Approach for Comparison of Small-World Networks
A. Demichev, V. Ilyin, A. Kryukov, S. Polyakov

TL;DR
This paper introduces a cost-quality analysis method to compare algorithms for constructing small-world networks, demonstrating that the proposed networks outperform existing ones in cost-efficiency within this class.
Contribution
It presents a novel approach for evaluating small-world network algorithms based on cost-quality tradeoffs and introduces new algorithms with superior ratios.
Findings
Proposed networks have the best cost-quality ratio among compared algorithms.
Analysis of multiple algorithms highlights tradeoffs in small-world network construction.
New algorithms outperform existing methods in efficiency and cost.
Abstract
We propose an approach based on analysis of cost-quality tradeoffs for comparison of efficiency of various algorithms for small-world network construction. A number of both known in the literature and original algorithms for complex small-world networks construction are shortly reviewed and compared. The networks constructed on the basis of these algorithms have basic structure of 1D regular lattice with additional shortcuts providing the small-world properties. It is shown that networks proposed in this work have the best cost-quality ratio in the considered class.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
