pith. sign in

arxiv: cond-mat/0301124 · v1 · pith:7ARTLHJHnew · submitted 2003-01-09 · ❄️ cond-mat.stat-mech

Search and Congestion in Complex Networks

Alex Arenas (1) , Antonio Cabrales (2) , Albert Diaz-Guilera (3) , Roger Guimera (4) , Fernando Vega-Redondo (5) ((1) Departament d'Enginyeria Informatica , Universitat Rovira i Virgili , Tarragona , (2) Departament d'Economia i Empresa
show 7 more authors
Universitat Pompeu Fabra Barcelona (3) Departament de Fisica Fonamental Universitat de Barcelona Barcelona (4) Departament d'Enginyeria Quimica Tarragona (5) Departament de Fonaments d'Analisi Economica Universitat d'Alacant Alacant)
This is my paper
classification ❄️ cond-mat.stat-mech
keywords searchcommunicationcongestionmodelnetworksablecomplexcope
0
0 comments X
read the original abstract

A model of communication that is able to cope simultaneously with the problems of search and congestion is presented. We investigate the communication dynamics in model networks and introduce a general framework that enables a search of optimal structures.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.