| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Optimal network topologies for local search with congestion | R. Guimera
; A. Arenas
; A. Diaz-Guilera
; F. Vega-Redondo
; A. Cabrales
; | Date: |
21 Jun 2002 | Journal: | Phys. Rev. Lett. 89, 248701 (2002) | Subject: | Disordered Systems and Neural Networks; Networking and Internet Architecture | cond-mat.dis-nn cs.NI | Abstract: | 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. | Source: | arXiv, cond-mat/0206410 | Other source: | [GID 25120] pmid12484988 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |