Vertices of high degree in the preferential attachment tree

Details Vertices of high degree in the preferential attachment tree Vertices of high degree in the preferential attachment tree

2010-12-26

arxiv.org/abs/1012.5550v2

Mathematics

Probability

52 pages; to appear in Electronic Journal of Probability

Scientific paper

We study the basic preferential attachment process, which generates a sequence of random trees, each obtained from the previous one by introducing a new vertex and joining it to one existing vertex, chosen with probability proportional to its degree. We investigate the number $D_t(\ell)$ of vertices of each degree $\ell$ at each time $t$, focussing particularly on the case where $\ell$ is a growing function of $t$. We show that $D_t(\ell)$ is concentrated around its mean, which is approximately $4t/\ell^3$, for all $\ell \le (t/\log t)^{-1/3}$; this is best possible up to a logarithmic factor.

Affiliated with

Also associated with

No associations

Rating

Vertices of high degree in the preferential attachment tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Vertices of high degree in the preferential attachment tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertices of high degree in the preferential attachment tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-22360