Geometry of weighted recursive and affine preferential attachment trees

Abstract: We study two models of growing recursive trees. For both models, initially the tree only contains one vertex

u_{1}

and at each time

n g e q 2

a new vertex

u_{n}

is added to the tree and its parent is chosen randomly according to some rule. In the emph{weighted recursive tree}, we choose the parent

u_{k}

of

u_{n}

among

u_{1}, u_{2}, d o t s, u_{n - 1}

with probability proportional to

w_{k}

, where

(w_{n})_{n g e q 1}

is some deterministic sequence that we fix beforehand. In the emph{affine preferential attachment tree with fitnesses}, the probability of choosing any

u_{k}

is proportional to

a_{k} + m a t h r m {d e g}^{+} (u_{k})

, where

m a t h r m {d e g}^{+} (u_{k})

denotes its current number of children, and the sequence of emph{fitnesses}

(a_{n})_{n g e q 1}

is deterministic and chosen as a parameter of the model. We show that for any sequence

(a_{n})_{n g e q 1}

, the corresponding preferential attachment tree has the same distribution as some weighted recursive tree with a emph{random} sequence of weights (with some explicit distribution). We then prove almost sure scaling limit convergences for some statistics associated with weighted recursive trees as time goes to infinity, such as degree sequence, height, profile and also the weak convergence of some measures carried on the tree. Thanks to the connection between the two models, these results also apply to affine preferential attachment trees.

Recommendations

Cites Work

Cited In (23)

This page was built for publication: Geometry of weighted recursive and affine preferential attachment trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2042867)