research-article

Free access

Preferential Attachment as a Unique Equilibrium

Authors:

Pierre Fraigniaud,

David PelegAuthors Info & Claims

WWW '18: Proceedings of the 2018 World Wide Web Conference

Pages 559 - 568

https://doi.org/10.1145/3178876.3186122

Published: 23 April 2018 Publication History

All formats PDF

Abstract

This paper demonstrates that the Preferential Attachment rule naturally emerges in the context of evolutionary network formation, as the unique Nash equilibrium of a simple social network game. In this game, each node aims at maximizing its degree in the future, representing its social capital in the "society" formed by the nodes and their connections. This result provides additional formal support to the commonly used Preferential Attachment model, initially designed to capture the "rich get richer" aphorism. In the process of establishing our result, we expose new connections between Preferential Attachment, random walks, and Young»s Lattice.

References

[1]

Réka Albert and Albert-László Barabási. Statistical mechanics of complex networks. Reviews of modern physics, 74(1):47, 2002.

[2]

David Avis, Kazuo Iwama, and Daichi Paku. Verifying nash equilibria in pagerank games on undirected web graphs. In International Symposium on Algorithms and Computation, pages 415--424. Springer, 2011.

Digital Library

[3]

Albert-László Barabási. Network science. Cambridge university press, 2016.

[4]

Béla Bollobás and Oliver Riordan. The diameter of a scale-free random graph. Combinatorica, 24(1):5--34, 2004.

Digital Library

[5]

Béla Bollobás, Oliver Riordan, Joel Spencer, Gábor Tusnády, et al. The degree sequence of a scale-free random graph process. Random Structures & Algorithms, 18(3):279--290, 2001.

Digital Library

[6]

Wei Chen, Shang-Hua Teng, Yajun Wang, and Yuan Zhou. On the alpha-sensitivity of nash equilibria in pagerank-based network reputation games. In FAW, pages 63--73. Springer, 2009.

Digital Library

[7]

Raissa M D'souza, Christian Borgs, Jennifer T Chayes, Noam Berger, and Robert D Kleinberg. Emergence of tempered preferential attachment from optimization. Proceedings of the National Academy of Sciences, 104(15):6112--6117, 2007.

[8]

Alex Fabrikant, Ankur Luthra, Elitza Maneva, Christos H Papadimitriou, and Scott Shenker. On a network creation game. In Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 347--351. ACM, 2003.

Digital Library

[9]

John Hopcroft and Daniel Sheldon. Network reputation games. Technical report, 2008.

[10]

Matthew O Jackson. The economics of social networks. In Proceedings of the 9th World Congress of the Econometric Society, vol. 1, pages 1--56. Cambridge University Press, 2006.

[11]

Matthew O Jackson and Brian W Rogers. Meeting strangers and friends of friends: How random are social networks? The American economic review, 97(3):890--915, 2007.

[12]

Jon Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. The web as a graph: measurements, models, and methods. Computing and combinatorics, pages 1--17, 1999.

Digital Library

[13]

Georgios Kouroupas, Evangelos Markakis, Christos Papadimitriou, Vasileios Rigas, and Martha Sideri. The web graph as an equilibrium. In International Symposium on Algorithmic Game Theory, pages 203--215. Springer, 2015.

[14]

Paul L Krapivsky and Sidney Redner. Organization of growing random networks. Physical Review E, 63(6):066123, 2001.

[15]

Pavel L Krapivsky and Sidney Redner. Network growth by copying. Physical Review E, 71(3):036118, 2005.

[16]

Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D Sivakumar, Andrew Tomkins, and Eli Upfal. Stochastic models for the web graph. In Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on, pages 57--65. IEEE, 2000.

Digital Library

[17]

David Asher Levin, Yuval Peres, and Elizabeth Lee Wilmer. Markov chains and mixing times. American Mathematical Soc.

[18]

L. Lovász. Random walks on graphs: A survey. In Combinatorics, Paul ErdH os is eighty, Vol. 2 (Keszthely, 1993), volume 2 of Bolyai Soc. Math. Stud., pages 353--397. János Bolyai Math. Soc., Budapest, 1996.

[19]

Eli A Meirom, Shie Mannor, and Ariel Orda. Network formation games with heterogeneous players and the internet structure. In Proceedings of the fifteenth ACM conference on Economics and computation, pages 735--752. ACM, 2014.

Digital Library

[20]

Mark Newman. Networks: an introduction. Oxford university press, 2010.

[21]

Mark EJ Newman. The structure and function of complex networks. SIAM review, 45(2):167--256, 2003.

Digital Library

[22]

Derek de Solla Price. A general theory of bibliometric and other cumulative advantage processes. Journal of the Association for Information Science and Technology, 27(5):292--306, 1976.

[23]

Bruce Sagan. The symmetric group: representations, combinatorial algorithms, and symmetric functions, volume 203. Springer Science & Business Media, 2013.

[24]

Remco Van Der Hofstad. Random graphs and complex networks, 2016.

[25]

Alexei Vázquez. Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations. Physical Review E, 67(5):056104, 2003.

Cited By

Istrate GBonchis CPelachaud CTaylor MFaliszewski PMascardi V(2022)Being Central on the CheapProceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems10.5555/3535850.3535924(651-659)Online publication date: 9-May-2022
https://dl.acm.org/doi/10.5555/3535850.3535924
Luo RNettasinghe BKrishnamurthy V(2022)Controlling Segregation in Social Network Dynamics as an Edge Formation GameIEEE Transactions on Network Science and Engineering10.1109/TNSE.2022.31627899:4(2317-2329)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TNSE.2022.3162789
Finocchiaro JMaio RMonachou FPatro GRaghavan MStoica ATsirtsis S(2021)Bridging Machine Learning and Mechanism Design towards Algorithmic FairnessProceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency10.1145/3442188.3445912(489-503)Online publication date: 3-Mar-2021
https://dl.acm.org/doi/10.1145/3442188.3445912
Show More Cited By

Index Terms

Preferential Attachment as a Unique Equilibrium
1. Theory of computation
  1. Theory and algorithms for application domains
    1. Algorithmic game theory and mechanism design
      1. Network formation
      2. Social networks

Recommendations

Random preferential attachment hypergraph
ASONAM '19: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

In the future, analysis of social networks will conceivably move from graphs to hypergraphs. However, theory has not yet caught up with this type of data organizational structure. By introducing and analyzing a general model of preferential attachment ...
Preferential attachment in online networks: measurement and explanations
WebSci '13: Proceedings of the 5th Annual ACM Web Science Conference

We perform an empirical study of the preferential attachment phenomenon in temporal networks and show that on the Web, networks follow a nonlinear preferential attachment model in which the exponent depends on the type of network considered. The ...
Sequential competition and the strategic origins of preferential attachment
Abstract
We analyze whether random network formation processes, such as preferential attachment, can emerge as the outcome of strategic behaviour. We represent network formation as an extensive game in which players sequentially form links as they enter ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

WWW '18: Proceedings of the 2018 World Wide Web Conference

April 2018

2000 pages

ISBN:9781450356398

General Chairs:
Pierre-Antoine Champin
Universitè Claude Bernard Lyon 1, France
,
Fabien Gandon
Inria, Université Côte d'Azur, CNRS, I3S, France
,
Lionel Médini
Université Claude Bernard Lyon 1, France
,
Program Chairs:
Mounia Lalmas
Spotify, UK
,
Panagiotis G. Ipeirotis
New York University, USA

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

IW3C2: International World Wide Web Conference Committee

In-Cooperation

SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web

Publisher

International World Wide Web Conferences Steering Committee

Republic and Canton of Geneva, Switzerland

Publication History

Published: 23 April 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Inria
ANR
CNRS LIA FILOFOCS
Project DESCARTES
LabEx Sciences Mathématiques de Paris (SMP)

Conference

WWW '18

Sponsor:

IW3C2

WWW '18: The Web Conference 2018

April 23 - 27, 2018

Lyon, France

Acceptance Rates

WWW '18 Paper Acceptance Rate 170 of 1,155 submissions, 15%;

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
761
Total Downloads

Downloads (Last 12 months)151
Downloads (Last 6 weeks)32

Reflects downloads up to 15 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Istrate GBonchis CPelachaud CTaylor MFaliszewski PMascardi V(2022)Being Central on the CheapProceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems10.5555/3535850.3535924(651-659)Online publication date: 9-May-2022
https://dl.acm.org/doi/10.5555/3535850.3535924
Luo RNettasinghe BKrishnamurthy V(2022)Controlling Segregation in Social Network Dynamics as an Edge Formation GameIEEE Transactions on Network Science and Engineering10.1109/TNSE.2022.31627899:4(2317-2329)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TNSE.2022.3162789
Finocchiaro JMaio RMonachou FPatro GRaghavan MStoica ATsirtsis S(2021)Bridging Machine Learning and Mechanism Design towards Algorithmic FairnessProceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency10.1145/3442188.3445912(489-503)Online publication date: 3-Mar-2021
https://dl.acm.org/doi/10.1145/3442188.3445912
Fraigniaud P(2021)How Do Mobile Agents Benefit from Randomness?Stabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-91081-5_7(90-107)Online publication date: 9-Nov-2021
https://doi.org/10.1007/978-3-030-91081-5_7
Stoica AHan JChaintreau A(2020)Seeding Network Influence in Biased Networks and the Benefits of DiversityProceedings of The Web Conference 202010.1145/3366423.3380275(2089-2098)Online publication date: 20-Apr-2020
https://dl.acm.org/doi/10.1145/3366423.3380275
Stoica AChaintreau A(2019)Fairness in Social Influence MaximizationCompanion Proceedings of The 2019 World Wide Web Conference10.1145/3308560.3317588(569-574)Online publication date: 13-May-2019
https://dl.acm.org/doi/10.1145/3308560.3317588
Ito K(undefined)Consensus-Building on Citations in Peer-to-Peer SystemsSSRN Electronic Journal10.2139/ssrn.3936833
https://doi.org/10.2139/ssrn.3936833

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten