Growing network with j-redirection
R. Lambiotte, M. Ausloos
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.
Create a lesson
Related papers
Distinct routes to phase transitions in spatial activation systems
Jialu Zhang, Guanyu Zhang, Leyang Xue et al.
District-Level Food Environment Indicators and Social Vulnerability in São Paulo
Pedro Lemes Sixel Lobo, Eric Tokuda, Kuruvilla Joseph Abraham et al.
Prompt Sensitivity of Generative Agents: Evidence from an Epidemic Model
Ross Williams, Niyousha Hosseinichimeh
Giant strongly biconnected components of directed networks: a generating function approach
Minsoo Yang, Reinhard Laubenbacher, Byungjoon Min
(k,n)-core percolation on hypergraphs with anchor nodes
Hoseung Jang, Byungjoon Min, Ginestra Bianconi
The complex relationship between anti-immigrant sentiment and exposure in the Netherlands
Benedikt Meylahn, Tommaso Giommoni, Mike Lees et al.