Random tree growth with general weight function

Details Random tree growth with general weight function Random tree growth with general weight function

2004-10-25

arxiv.org/abs/math/0410532v1

Mathematics

Probability

17 pages, no figures, submitted to Random Structures and Algorithms

Scientific paper

We extend the results of B. Bollobas, O. Riordan, J. Spencer, G. Tusnady, and Mori. We consider a model of random tree growth, where at each time unit a new node is added and attached to an already existing node chosen at random. The probability with which a node with degree $k$ is chosen is proportional to $w(k)$, where $w$ is a fixed weight function. We prove that if $w$ fulfills some asymptotic requirements then the degree sequence converges in probability, we give the limit. In particular if $w$ is asymptotically linear then the degree sequence decays with power law. Our method of proof is analytic rather than combinatorial, having the advantage of robustness: only asymptotic properties of the weight function $w$ are used, while in the cited papers the explicit law $w(k)=ak+b$ is assumed.

Affiliated with

Also associated with

No associations

Rating

Random tree growth with general weight function 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 Random tree growth with general weight function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random tree growth with general weight function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-477829