Abstract
We introduce a model of evolving preferential attachment trees where vertices are assigned weights, and the evolution of a vertex depends not only on its own weight, but also on the weights of its neighbours. We study empirical measures associated with edges with endpoints having certain weights, and degrees of vertices having a given weight. We show that the former exhibits a condensation phenomenon under a certain critical condition, whereas the latter behaves like a mixture of a power law distribution, depending on the weight distribution. Moreover, in the absence of condensation, for any measurable set we prove almost-sure convergence of the measure of that set under the related measure. This generalises existing results on the Bianconi-Barabási tree as well as on an evolving tree model introduced by the second author. Finally, as an application of our results, we provide criteria under which the degree distribution of this model behaves like a power law, and prove a limiting statement about the growth of the neighbourhood of a fixed vertex.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.