Preferential attachment with partial information
arXiv:1409.1013 · doi:10.1140/epjb/e2014-50595-0
Abstract
We propose a preferential attachment model for network growth where new entering nodes have a partial information about the state of the network. Our main result is that the presence of bounded information modifies the degree distribution by introducing an exponential tail, while it preserves a power law behaviour over a finite small range of degrees. On the other hand, unbounded information is sufficient to let the network grow as in the standard Barabási-Albert model. Surprisingly, the latter feature holds true also when the fraction of known nodes goes asymptotically to zero. Analytical results are compared to direct simulations.
References in corpus (15)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Community detection in graphs
- Power-law distributions in empirical data
- Spatial Networks
- Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
- Geographical dispersal of mobile communication networks
- Truncation of power law behavior in "scale-free" network models due to information filtering
- Duplication-divergence model of protein interaction network
- Scale-free network growth by ranking
- Scale Free Networks from Self-Organisation
- The power of choice in network growth
- Logarithmic growth dynamics in software networks
- Preferential attachment with information filtering - node degree probability distribution properties
- "Winner takes it all": strongest node rule for evolution of scale free networks