Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/421
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAustin, K-
dc.contributor.authorRodgers, GJ-
dc.coverage.spatial15en
dc.date.accessioned2006-11-29T13:59:41Z-
dc.date.available2006-11-29T13:59:41Z-
dc.date.issued2003-
dc.identifier.citationPhysica A, 326: 593-603en
dc.identifier.urihttp://www.elsevier.com/wps/find/journaldescription.cws_home/505702/description#descriptionen
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/421-
dc.description.abstractGrowing networks are introduced in which the vertices are allocated one of two possible growth rates; type A with probability p(t), or type B with probability 1−p(t). We investigate the networks using rate equations to obtain their degree distributions. In the first model (I), the network is constructed by connecting an arriving vertex to either a type A vertex of degree k with rate μk, where μ0, or to a type B vertex of degree k with rate k. We study several p(t), starting with p(t) as a constant and then considering networks where p(t) depends on network parameters that change with time. We find the degree distributions to be power laws with exponents mostly in the range 2γ3. In the second model (II), the network is constructed in the same way but with growth rate k for type A vertices and 1 for type B vertices. We analyse the case p(t)=c, where 0c1 is a constant, and again find a power-law degree distribution with an exponent 2γ3.en
dc.format.extent343286 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherElsevieren
dc.subjectGrowing networksen
dc.subjectFitnessen
dc.subjectPower lawen
dc.titleGrowing networks with two vertex typesen
dc.typeResearch Paperen
dc.identifier.doihttp://dx.doi.org/10.1016/S0378-4371(03)00394-7-
Appears in Collections:Mathematical Physics
Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
Growing networks.pdf335.24 kBAdobe PDFView/Open


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