Random networks with preferential growth and vertex death

preprint2015arXivOpen access

Abstract

A dynamic model for a random network evolving in continuous time is defined where new vertices are born and existing vertices may die. The fitness of a vertex is defined as the accumulated in-degree of the vertex and a new vertex is connected to an existing vertex with probability proportional to a function bb of the fitness of the existing vertex. Furthermore, a vertex dies at a rate given by a function dd of its fitness. Using results from the theory of general branching processes, an expression for the asymptotic empirical fitness distribution {pk}\{p_k\} is derived and analyzed for a number of specific choices of bb and dd. When b(i)=i+αb(i)=i+α and d(i)=βd(i)=β -- that is, linear preferential attachment for the newborn and random deaths -- then pk∼k−(2+α)p_k\sim k^{-(2+α)}. When b(i)=i+1b(i)=i+1 and d(i)=β(i+1)d(i)=β(i+1), with β<1β<1, then pk∼(1+β)−kp_k\sim (1+β)^{-k}, that is, if also the death rate is proportional to the fitness, then the power law distribution is lost. Furthermore, when b(i)=i+1b(i)=i+1 and d(i)=β(i+1)γd(i)=β(i+1)^γ, with β,γ<1β,γ<1, then log⁡pk∼−kγ\log p_k\sim -k^γ -- a stretched exponential distribution. The momentaneous in-degrees are also studied and simulations suggest that their behaviour is qualitatively similar to that of the fitnesses.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.