Random networks with sublinear preferential attachment: Degree evolutions

Details Random networks with sublinear preferential attachment: Degree evolutions Random networks with sublinear preferential attachment: Degree evolutions

2008-07-30

arxiv.org/abs/0807.4904v1

Mathematics

Probability

41 Pages

Scientific paper

We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and then have a closer look at the temporal evolution of the degrees of individual vertices, which we describe in terms of large and moderate deviation principles. Using these results, we expose an interesting phase transition: in cases of strong preference of large degrees, eventually a single vertex emerges forever as vertex of maximal degree, whereas in cases of weak preference, the vertex of maximal degree is changing infinitely often. Loosely speaking, the transition between the two phases occurs in the case when a new edge is attached to an existing vertex with a probability proportional to the root of its current degree.

Affiliated with

Also associated with

No associations

Rating

Random networks with sublinear preferential attachment: Degree evolutions 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 networks with sublinear preferential attachment: Degree evolutions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random networks with sublinear preferential attachment: Degree evolutions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-259863