To access the full text documents, please follow this link: http://hdl.handle.net/2099.1/5728

Identificació de xarxes complexes
Sala Viñas, Jonàs
Díaz Guilera, Albert
A whole spectrum of networks is generated with a quasistatic growth model. N nodes are located in a 2D lattice and a fixed number of links are added between them. Links are created either preferentially with strenght γ or with a nearest neighbor, thus obtaining from regular lattices to random or scale free networks. Throw simulations, we study the efficiency of a search and congestion algorithm on such networks and relate the results to their topology. Some new figures and techniques are presented that clarify results in previous works. Finally, a certain change in the average load of networks for γ>l, which had no previous explanation, is found to be related with a transition in the average degree of the most connected node.
Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
Social networks
Xarxes complexes
Congestió
Comunicació
Ajust de distribucions de grau
Xarxes socials
Attribution-NonCommercial-NoDerivs 2.5 Spain
http://creativecommons.org/licenses/by-nc-nd/2.5/es/
info:eu-repo/semantics/masterThesis
Universitat Politècnica de Catalunya
         

Show full item record

Related documents

Other documents of the same author

Sala Viñas, Jonàs; Guàrdia Manuel, Elvira; Martí Rabassa, Jordi; Spangberg, Daniel; Masia, Marco
Martí Rabassa, Jordi; Sala Viñas, Jonàs; Guàrdia Manuel, Elvira; Gordillo Bargueño, Maria Carmen
 

Coordination

 

Supporters