A geometric preferential attachment model with fitness

Details A geometric preferential attachment model with fitness A geometric preferential attachment model with fitness

2008-01-10

arxiv.org/abs/0801.1612v1

Mathematics

Combinatorics

Scientific paper

We study a random graph $G_n$, which combines aspects of geometric random graphs and preferential attachment. The resulting random graphs have power-law degree sequences with finite mean and possibly infinite variance. In particular, the power-law exponent can be any value larger than 2. The vertices of $G_n$ are $n$ sequentially generated vertices chosen at random in the unit sphere in $\mathbb R^3$. A newly added vertex has $m$ edges attached to it and the endpoints of these edges are connected to old vertices or to the added vertex itself. The vertices are chosen with probability proportional to their current degree plus some initial attractiveness and multiplied by a function, depending on the geometry.

Affiliated with

Also associated with

No associations

Rating

A geometric preferential attachment model with fitness 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 A geometric preferential attachment model with fitness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A geometric preferential attachment model with fitness will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-436522