Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/311
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKrapivsky, PL-
dc.contributor.authorRodgers, GJ-
dc.contributor.authorRedner, S-
dc.coverage.spatial4en
dc.date.accessioned2006-10-30T10:18:17Z-
dc.date.available2006-10-30T10:18:17Z-
dc.date.issued2001-
dc.identifier.citationPhys Rev Lett. 86(23): 5401-4, Jun 2001en
dc.identifier.otherPACS: 89.75.Hc, 05.50.+q, 87.18.Sn, 89.75.Da-
dc.identifier.urihttp://link.aps.org/abstract/PRL/v86/p5401en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/311-
dc.description.abstractThe in-degree and out-degree distributions of a growing network model are determined. The in-degree is the number of incoming links to a given node (and vice versa for out-degree. The network is built by (i) creation of new nodes which each immediately attach to a pre-existing node, and (ii) creation of new links between pre-existing nodes. This process naturally generates correlated in- and out-degree distributions. When the node and link creation rates are linear functions of node degree, these distributions exhibit distinct power-law forms. By tuning the parameters in these rates to reasonable values, exponents which agree with those of the web graph are obtained.en
dc.format.extent280548 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherAmerican Physical Societyen
dc.subjectStatistical mechanicsen
dc.subjectDisordered systems and neural networksen
dc.subjectAdaptation and self-organizing systemsen
dc.titleDegree distributions of growing networksen
dc.typeResearch Paperen
dc.identifier.doihttp://dx.doi.org/10.1103/PhysRevLett.86.5401-
Appears in Collections:Mathematical Physics
Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
Fulltext.pdf273.97 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.