Optimal network topologies for local search with congestion
<|reference_start|>Optimal network topologies for local search with congestion: The problem of searchability in decentralized complex networks is of great importance in computer science, economy and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and obtain expressions for the average search cost--written in terms of the search algorithm and the topological properties of the network--both in presence and abscence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: star-like configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when the number of parallel searches is large.<|reference_end|>
@article{guimera2002optimal,
    title={Optimal network topologies for local search with congestion},
    author={R. Guimera, A. Arenas, A. Diaz-Guilera, F. Vega-Redondo, A. Cabrales},
    journal={Phys. Rev. Lett. 89, 248701 (2002)},
    year={2002},
    doi={10.1103/PhysRevLett.89.248701},
    archivePrefix={arXiv},
    eprint={cond-mat/0206410},
    primaryClass={cond-mat.dis-nn cs.NI}
}