Advertisement

Search and Congestion in Complex Networks

  • Alex Arenas
  • Antonio Cabrales
  • Albert Díaz-Guilera
  • Roger Guimerà
  • Fernando Vega-Redondo
Chapter
Part of the Lecture Notes in Physics book series (LNP, volume 625)

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. Those networks consist in a regular lattice ordering plus some long-range short-cuts with a given probability. The destination nodes of the short-cuts are chosen according to some degree of preferentiality. We study then the interplay between short- and long-range links and preferentiality. We also introduce a general framework that enables a search of optimal structures. A relation between dynamical properties and topological properties of the network is found and exploited.

Keywords

Complex Network Destination Node Central Node Average Path Length Regular Lattice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin/Heidelberg 2003

Authors and Affiliations

  • Alex Arenas
    • 1
  • Antonio Cabrales
    • 2
  • Albert Díaz-Guilera
    • 3
  • Roger Guimerà
    • 4
  • Fernando Vega-Redondo
    • 5
  1. 1.Departament d’Enginyeria InformàticaUniversitat Rovira i VirgiliTarragona
  2. 2.Departament d’Economia i EmpresaUniversitat Pompeu FabraBarcelona
  3. 3.Departament de Física FonamentalUniversitat de BarcelonaBarcelona
  4. 4.Departament d’Enginyeria QuímicaUniversitat Rovira i VirgiliTarragona
  5. 5.Departament de Fonaments d’Anàlisi EconòmicaUniversitat d’AlacantAlacant

Personalised recommendations