A Quality and Cost Approach for Comparison of Small-World Networks
arXiv:1301.0683 · doi:10.1142/S0219265913500084
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.
arXiv comment27 pages, 16 figures, 1 table
References in corpus (9)
- Statistical mechanics of complex networks
- Spatial Networks
- Designing optimal transport networks
- Physical realizability of small-world networks
- Shortest paths on systems with power-law distributed long-range connections
- Hierarchical, Regular Small-World Networks
- Small-world phenomena and the statistics of linear polymer networks
- Exact Solution for Optimal Navigation with Total Cost Restriction
- Geometry and Dynamics for Hierarchical Regular Networks