Mostra el registre d'ítem simple
Identificació de xarxes complexes
dc.contributor | Díaz Guilera, Albert |
dc.contributor.author | Sala Viñas, Jonàs |
dc.date.accessioned | 2008-11-03T11:33:55Z |
dc.date.available | 2008-11-03T11:33:55Z |
dc.date.issued | 2007-06-28 |
dc.identifier.uri | http://hdl.handle.net/2099.1/5728 |
dc.description.abstract | 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. |
dc.language.iso | cat |
dc.publisher | Universitat Politècnica de Catalunya |
dc.rights | Attribution-NonCommercial-NoDerivs 2.5 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.5/es/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors |
dc.subject.lcsh | Social networks |
dc.subject.other | Xarxes complexes |
dc.subject.other | Congestió |
dc.subject.other | Comunicació |
dc.subject.other | Ajust de distribucions de grau |
dc.title | Identificació de xarxes complexes |
dc.type | Master thesis |
dc.subject.lemac | Xarxes socials |
dc.rights.access | Open Access |
dc.audience.educationlevel | Màster |
dc.audience.mediator | Facultat d'Informàtica de Barcelona |
dc.audience.degree | MÀSTER UNIVERSITARI EN FÍSICA COMPUTACIONAL I APLICADA (Pla 2006) |