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 we obtain expressions for the average search cost both in the presence and the absence 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: starlike configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when it is large.
Optimal network topologies for local search with congestion
R. Guimerà,A. Arenas,A. Díaz-Guilera,F. Vega-Redondo,A. Cabrales
Published 2002 in Physical Review Letters
ABSTRACT
PUBLICATION RECORD
- Publication year
2002
- Venue
Physical Review Letters
- Publication date
2002-06-21
- Fields of study
Sociology, Physics, Computer Science, Medicine
- Identifiers
- External record
- Source metadata
Semantic Scholar, PubMed
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-16 of 16 references · Page 1 of 1