Popularity versus similarity in growing networks

Fragkiskos Papadopoulos (), Maksim Kitsak, M. Ángeles Serrano, Marián Boguñá and Dmitri Krioukov ()
Additional contact information
Fragkiskos Papadopoulos: Computer Engineering and Informatics, Cyprus University of Technology, 33 Saripolou Street, 3036 Limassol, Cyprus
Maksim Kitsak: Cooperative Association for Internet Data Analysis (CAIDA), University of California, San Diego (UCSD), La Jolla, California 92093, USA
M. Ángeles Serrano: Departament de Física Fonamental, Universitat de Barcelona, Martí i Franquès 1, 08028 Barcelona, Spain
Marián Boguñá: Departament de Física Fonamental, Universitat de Barcelona, Martí i Franquès 1, 08028 Barcelona, Spain
Dmitri Krioukov: Cooperative Association for Internet Data Analysis (CAIDA), University of California, San Diego (UCSD), La Jolla, California 92093, USA

Nature, 2012, vol. 489, issue 7417, 537-540

Abstract: A framework is developed in which new connections to a growing network optimize geometric trade-offs between popularity and similarity, instead of simply preferring popular nodes; this approach accurately describes the large-scale evolution of various networks.

Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (31)

Downloads: (external link)
https://www.nature.com/articles/nature11459 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nat:nature:v:489:y:2012:i:7417:d:10.1038_nature11459

Ordering information: This journal article can be ordered from
https://www.nature.com/

DOI: 10.1038/nature11459

Access Statistics for this article

Nature is currently edited by Magdalena Skipper

More articles in Nature from Nature
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().