Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/2227
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGoel, Rimjhim-
dc.date.accessioned2024-03-22T11:34:11Z-
dc.date.available2024-03-22T11:34:11Z-
dc.date.issued2023-05-
dc.identifier.urihttp://hdl.handle.net/123456789/2227-
dc.descriptionembargo perioden_US
dc.description.abstractPreferential Attachment Graphs are a class of random graphs used to model scale-free growing networks. We study Preferential Attachment Trees with constant additive and multiplicative fitness. Degree profile of a specific vertex has been explored by using the well-known technique of writing recursions and some classic results on Triangular Pòlya Urns. In this thesis, we investigate some sub-structures of the Preferential Attachment Trees with constant fitness. In particular, we study the number of cherries and leaves in the tree. We obtain expressions for the expectation of the number of these sub-structures attached to a specific vertex as well as the total number in the tree at time t. Further, by appealing to Pòlya Urns with weights, we also show that the number of these sub-structures scaled with time converges almost surely to a deterministic limit.en_US
dc.language.isoen_USen_US
dc.publisherIISER Mohalien_US
dc.subjectPrperties of Preferentialen_US
dc.subjectAttachment Trees with Fitnessen_US
dc.titlePrperties of Preferential Attachment Trees with Fitnessen_US
dc.typeThesisen_US
dc.guideNeeraja Sahasrabudheen_US
Appears in Collections:MS-18

Files in This Item:
File Description SizeFormat 
Need To Add…Full Text.pdf15.36 kBAdobe PDFView/Open


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