Self Organized Scale-Free Networks from Merging and Regeneration

dc.creatorKim, Beom Jun
dc.creatorTrusina, Ala
dc.creatorMinnhagen, Petter
dc.creatorSneppen, Kim
dc.date2004-03-05
dc.date.accessioned2026-07-07T06:24:05Z
dc.date.available2026-07-07T06:24:05Z
dc.descriptionWe consider the self organizing process of merging and regeneration of vertices in complex networks and demonstrate that a scale-free degree distribution emerges in a steady state of such a dynamics. The merging of neighbor vertices in a network may be viewed as an optimization of efficiency by minimizing redundancy. It is also a mechanism to shorten the distance and thus decrease signaling times between vertices in a complex network. Thus the merging process will in particular be relevant for networks where these issues related to global signaling are of concern.
dc.identifierhttps://arxiv.org/abs/nlin/0403006
dc.identifierhttp://arxiv.org/abs/nlin/0403006
dc.identifierEur. Phys. J. B 43, 369-372 (2005)
dc.identifierdoi:10.1140/epjb/e2005-00065-y
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/96424
dc.subjectAdaptation and Self-Organizing Systems
dc.subjectDisordered Systems and Neural Networks
dc.titleSelf Organized Scale-Free Networks from Merging and Regeneration
dc.typetext

Files

Collections