# Popularity versus similarity in growing networks

@article{Papadopoulos2012PopularityVS, title={Popularity versus similarity in growing networks}, author={Fragkiskos Papadopoulos and Mari{\'a}n Bogu{\~n}{\'a} and Dmitri V. Krioukov}, journal={Nature}, year={2012}, volume={489}, pages={537-540} }

The principle that ‘popularity is attractive’ underlies preferential attachment, which is a common explanation for the emergence of scaling in growing networks. If new connections are made preferentially to more popular nodes, then the resulting distribution of the number of connections possessed by nodes follows power laws, as observed in many real networks. Preferential attachment has been directly validated for some real networks (including the Internet), and can be a consequence of…

## 459 Citations

Network science: Luck or reason

- Computer ScienceNature
- 2012

This study shows that popularity is a strong force in shaping complex network structure and dynamics, but so too is similarity, and develops a model that increases the accuracy of network-evolution predictions by considering the trade-offs between popularity and similarity.

The Role of Temporal Trends in Growing Networks

- Computer SciencePloS one
- 2016

This work addresses an inherent trait of complex networks, which greatly affects their growth and structure, and develops a unified model to address its interaction with preferential attachment, named Trending Preferential Attachment (TPA), in which edges become less influential as they age.

Fitness networks for real world systems via modified preferential attachment

- Computer Science
- 2017

A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities

- Computer Science
- 2017

The nPSO is proposed as a valid and efficient model to generate networks with communities in the hyperbolic space, which can be adopted as a realistic benchmark for different tasks such as community detection and link prediction.

Coupling effect of nodes popularity and similarity on social network persistence

- Computer ScienceScientific reports
- 2017

Analysis for nodes under a coevolution model characterizes individual activity changes under three network growth modes: following the descending order of nodes’ popularity, similarity or uniform random shows the evolution of nodes activity not only depends on network topology, but also their connective typology.

Homophily versus preferential attachment: Evolutionary mechanisms of scientific collaboration networks

- Psychology
- 2014

Homophily and preferential attachment are among the most recognized mechanisms of network evolution. Instead of examining the two mechanisms separately, this study considers them jointly in a…

Emergence of Soft Communities from Geometric Preferential Attachment

- Computer ScienceScientific reports
- 2015

This work shows how latent network geometry coupled with preferential attachment of nodes to this geometry fills this gap in growing networks, and calls this mechanism geometric preferential attachment (GPA), and validates it against the Internet.

The co-evolution of brand effect and competitiveness in evolving networks

- Computer Science, EconomicsArXiv
- 2013

The paper provides an explicit analytical expression of degree distributions of the network and introduces a general framework that allows us to investigate the competitive aspect of real networks, instead of simply preferring popular nodes, and reveals that the model accurately describes the evolution of social and technological networks.

Generalised popularity-similarity optimisation model for growing hyperbolic networks beyond two dimensions

- Computer ScienceScientific reports
- 2022

The d PSO model is introduced, a generalisation of the popularity-similarity optimisation model to any arbitrary integer dimension $$d>2$$ d > 2 and shows that their major structural properties can be affected by the dimension of the underlying hyperbolic space in a non-trivial way.

## References

SHOWING 1-10 OF 81 REFERENCES

Linking via social similarity: The emergence of community structure in scale-free network

- Computer Science2009 1st IEEE Symposium on Web Society
- 2009

A simplified model which exhibits community structure, power-law degree distribution and high clustering, and is elegant for modeling large-scale social networks with community structure and has potential applications in studying dynamics on networks withcommunity structure is proposed.

Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2003

It is claimed that an effective linear preferential attachment is the natural outcome of growing network models based on local rules and that the local models offer an explanation for other properties like the clustering hierarchy and degree correlations recently observed in complex networks.

Emergence of tempered preferential attachment from optimization

- EconomicsProceedings of the National Academy of Sciences
- 2007

It is suggested that, in general, optimization models that give rise to preferential attachment with saturation and viability effects form a good starting point for the analysis of many networks.

Measuring preferential attachment for evolving networks

- Computer Science
- 2001

Measurements on four networks indicate that the rate at which nodes acquire links depends on the node's degree, offering direct quantitative support for the presence of preferential attachment.

Highly clustered scale-free networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2002

The model shows stylized features of real-world networks: power-law distribution of degree, linear preferential attachment of new links, and a negative correlation between the age of a node and its link attachment rate.

Degree Distribution of Competition-Induced Preferential Attachment Graphs

- MathematicsCombinatorics, Probability and Computing
- 2005

This work rigorously determines the degree distribution for the family of random graph models, and proves that the general model has a power-law degree distribution up to a cut-off, and establishes monotonicity of the power as a function of the two parameters.

Scale-free network growth by ranking.

- Computer SciencePhysical review letters
- 2006

A criterion of network growth that explicitly relies on the ranking of the nodes according to any prestige measure, be it topological or not is proposed, which may explain the frequency and robustness of scale-free degree distributions in real networks, as illustrated by the special case of the Web graph.

Meeting Strangers and Friends of Friends: How Random are Social Networks?

- Computer Science
- 2007

It is shown that as the random/network-based meeting ratio varies, the resulting degree distributions can be ordered in the sense of stochastic dominance, which allows us to infer how the formation process affects average utility in the network.

Preferential attachment in growing spatial networks

- MathematicsPhysical review. E, Statistical, nonlinear, and soft matter physics
- 2011

It is shown that curvature singularities in these spaces can give rise to asymptotic Bose-Einstein condensation, but transient condensation can be observed also in smooth hyperbolic spaces with strong curvature.

Scale-free networks from varying vertex intrinsic fitness.

- BiologyPhysical review letters
- 2002

A new mechanism leading to scale-free networks is proposed, which is called a good-get-richer mechanism, in which sites with larger fitness are more likely to become hubs (i.e., to be highly connected).