Growing network with j-redirection

Abstract

A model for growing information networks is introduced where nodes receive new links through j-redirection, i.e. the probability for a node to receive a link depends on the number of paths of length j arriving at this node. In detail, when a new node enters the network, it either connects to a randomly selected node, or to the j -ancestor of this selected node. The j -ancestor is found by following j links from the randomly selected node. The system is shown to undergo a transition to a phase where condensates develop. We also find analytical predictions for the height statistics and show numerically the non-trivial behaviour of the degree distribution.

7 pages

References in corpus (6)

• The structure and function of complex networks
• Finding Scientific Gems with Google
• Log-Networks
• Reciprocity and the Emergence of Power Laws in Social Networks
• Condensation transitions in a model for a directed network with weighted links
• Bose-Einstein condensation in random directed networks

Cited by in corpus (8)

• Local Leaders in Random Networks
• Addition-Deletion Networks
• Preferential attachment mechanism of complex network growth: "rich-gets-richer" or "fit-gets-richer"?
• Highly Dispersed Networks Generated by Enhanced Redirection
• Highly Dispersed Networks
• Random Ancestor Trees
• How visas shape and make visible the geopolitical architecture of the planet
• Activity ageing in growing networks