Mutual selection in network evolution: the role of the intrinsic fitness

Abstract

We propose a new mechanism leading to scale-free networks which is based on the presence of an intrinsic character of a vertex called fitness. In our model, a vertex $i$ is assigned a fitness $x_i$, drawn from a given probability distribution function $f(x)$. During network evolution, with rate $p$ we add a vertex $j$ of fitness $x_j$ and connect to an existing vertex $i$ of fitness $x_i$ selected preferentially to a linking probability function $g(x_i,x_j)$ which depends on the fitnesses of the two vertices involved and, with rate $1-p$ we create an edge between two already existed vertices with fitnesses $x_i$ and $x_j$, with a probability also preferential to the connection function $g(x_i,x_j)$. For the proper choice of $g$, the resulting networks have generalized power laws, irrespective of the fitness distribution of vertices.

ws-ijmpc.tex

References in corpus (3)

• Weighted evolving networks: coupling topology and weights dynamics
• Fitness-dependent topological properties of the World Trade Web
• Vertex Intrinsic Fitness: How to Produce Arbitrary Scale-Free Networks

Cited by in corpus (1)

• Incremental formation of scale-free fitness networks