Toward a Next Generation of Network Models for the Web

J.M. Akkermans, R.R. Bakhshi

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

It is generally thought that the World Wide Web belongs to the class of complex networks that is scale-free: the distribution of the number of links that nodes have follows a power law ('rich-get-richer' effect). This phenomenon is explained by a combination of theoretical-computational and empirical analysis based on stochastic network models. However, current network models embody a number of assumptions and idealizations that are not valid for the Web. Better and richer network models are needed, in association with a much more refined and in-depth empirical data gathering and analysis. In particular, the understanding of the dynamics leaves much to desire. In this paper we present a dynamic network model that avoids a number of unrealistic idealizations commonly introduced. We show how properties such as average degree and power laws are the outcome of dynamic network parameters. Exemplified by a Wikipedia case study, we show how these dynamic parameters might be empirically measured directly. We falsify several widely held ideas about the emergence of power laws: (i) that they are related to growing networks; (ii) that they are related to (linear) preferential attachment; (iii) that they may hold strictly. Power laws do not have the status of a first principle in networks: if they hold, they are just conditional and approximate empirical regularities.
Original languageEnglish
Title of host publicationACM Web Science Conference
PublisherACM
Pages1-10
DOIs
Publication statusPublished - 2013
EventACM WebSci'13 -
Duration: 1 Jan 20131 Jan 2013

Conference

ConferenceACM WebSci'13
Period1/01/131/01/13

Fingerprint

World Wide Web
Complex networks

Cite this

Akkermans, J. M., & Bakhshi, R. R. (2013). Toward a Next Generation of Network Models for the Web. In ACM Web Science Conference (pp. 1-10). ACM. https://doi.org/10.1145/2464464.2464517
Akkermans, J.M. ; Bakhshi, R.R. / Toward a Next Generation of Network Models for the Web. ACM Web Science Conference. ACM, 2013. pp. 1-10
@inproceedings{05c64d16c3094a6e8fd84c1ebb4b4888,
title = "Toward a Next Generation of Network Models for the Web",
abstract = "It is generally thought that the World Wide Web belongs to the class of complex networks that is scale-free: the distribution of the number of links that nodes have follows a power law ('rich-get-richer' effect). This phenomenon is explained by a combination of theoretical-computational and empirical analysis based on stochastic network models. However, current network models embody a number of assumptions and idealizations that are not valid for the Web. Better and richer network models are needed, in association with a much more refined and in-depth empirical data gathering and analysis. In particular, the understanding of the dynamics leaves much to desire. In this paper we present a dynamic network model that avoids a number of unrealistic idealizations commonly introduced. We show how properties such as average degree and power laws are the outcome of dynamic network parameters. Exemplified by a Wikipedia case study, we show how these dynamic parameters might be empirically measured directly. We falsify several widely held ideas about the emergence of power laws: (i) that they are related to growing networks; (ii) that they are related to (linear) preferential attachment; (iii) that they may hold strictly. Power laws do not have the status of a first principle in networks: if they hold, they are just conditional and approximate empirical regularities.",
author = "J.M. Akkermans and R.R. Bakhshi",
year = "2013",
doi = "10.1145/2464464.2464517",
language = "English",
pages = "1--10",
booktitle = "ACM Web Science Conference",
publisher = "ACM",

}

Akkermans, JM & Bakhshi, RR 2013, Toward a Next Generation of Network Models for the Web. in ACM Web Science Conference. ACM, pp. 1-10, ACM WebSci'13, 1/01/13. https://doi.org/10.1145/2464464.2464517

Toward a Next Generation of Network Models for the Web. / Akkermans, J.M.; Bakhshi, R.R.

ACM Web Science Conference. ACM, 2013. p. 1-10.

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Toward a Next Generation of Network Models for the Web

AU - Akkermans, J.M.

AU - Bakhshi, R.R.

PY - 2013

Y1 - 2013

N2 - It is generally thought that the World Wide Web belongs to the class of complex networks that is scale-free: the distribution of the number of links that nodes have follows a power law ('rich-get-richer' effect). This phenomenon is explained by a combination of theoretical-computational and empirical analysis based on stochastic network models. However, current network models embody a number of assumptions and idealizations that are not valid for the Web. Better and richer network models are needed, in association with a much more refined and in-depth empirical data gathering and analysis. In particular, the understanding of the dynamics leaves much to desire. In this paper we present a dynamic network model that avoids a number of unrealistic idealizations commonly introduced. We show how properties such as average degree and power laws are the outcome of dynamic network parameters. Exemplified by a Wikipedia case study, we show how these dynamic parameters might be empirically measured directly. We falsify several widely held ideas about the emergence of power laws: (i) that they are related to growing networks; (ii) that they are related to (linear) preferential attachment; (iii) that they may hold strictly. Power laws do not have the status of a first principle in networks: if they hold, they are just conditional and approximate empirical regularities.

AB - It is generally thought that the World Wide Web belongs to the class of complex networks that is scale-free: the distribution of the number of links that nodes have follows a power law ('rich-get-richer' effect). This phenomenon is explained by a combination of theoretical-computational and empirical analysis based on stochastic network models. However, current network models embody a number of assumptions and idealizations that are not valid for the Web. Better and richer network models are needed, in association with a much more refined and in-depth empirical data gathering and analysis. In particular, the understanding of the dynamics leaves much to desire. In this paper we present a dynamic network model that avoids a number of unrealistic idealizations commonly introduced. We show how properties such as average degree and power laws are the outcome of dynamic network parameters. Exemplified by a Wikipedia case study, we show how these dynamic parameters might be empirically measured directly. We falsify several widely held ideas about the emergence of power laws: (i) that they are related to growing networks; (ii) that they are related to (linear) preferential attachment; (iii) that they may hold strictly. Power laws do not have the status of a first principle in networks: if they hold, they are just conditional and approximate empirical regularities.

U2 - 10.1145/2464464.2464517

DO - 10.1145/2464464.2464517

M3 - Conference contribution

SP - 1

EP - 10

BT - ACM Web Science Conference

PB - ACM

ER -