Physics – Condensed Matter – Disordered Systems and Neural Networks
Scientific paper
2006-02-03
Phys. Rev. Lett. 96, 218701 (2006)
Physics
Condensed Matter
Disordered Systems and Neural Networks
4 pages, 2 figures. We extended the model to account for ranking by arbitrarily distributed fitness. Final version to appear o
Scientific paper
10.1103/PhysRevLett.96.218701
Network growth is currently explained through mechanisms that rely on node prestige measures, such as degree or fitness. In many real networks those who create and connect nodes do not know the prestige values of existing nodes, but only their ranking by prestige. We propose a criterion of network growth that explicitly relies on the ranking of the nodes according to any prestige measure, be it topological or not. The resulting network has a scale-free degree distribution when the probability to link a target node is any power law function of its rank, even when one has only partial information of node ranks. Our criterion may explain the frequency and robustness of scale-free degree distributions in real networks, as illustrated by the special case of the Web graph.
Flammini Alessandro
Fortunato Santo
Menczer Filippo
No associations
LandOfFree
Scale-free network growth by ranking 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 Scale-free network growth by ranking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scale-free network growth by ranking will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-484500