Empirical validation of the buckley-osthus model for the web host graph: degree and edge distributions

Authors:
Maxim Zhukovskiy;Dmitry Vinogradov;Yuri Pritykin;Liudmila Ostroumova;Evgeniy Grechnikov;Gleb Gusev;Pavel Serdyukov;Andrei Raigorodskii
Affiliations:
Yandex, Moscow, Russian Fed.;Yandex, Moscow, Russian Fed.;Yandex, Moscow, Russian Fed.;Yandex, Moscow, Russian Fed.;Yandex, Moscow, Russian Fed.;Yandex, Moscow, Russian Fed.;Yandex, Moscow, Russian Fed.;Yandex, Moscow, Russian Fed.
Venue:
Proceedings of the 21st ACM international conference on Information and knowledge management
Year:
2012

Citing 9
Cited 0

The Web as a graph

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
The degree sequence of a scale-free random graph process

Random Structures & Algorithms
The Diameter of a Scale-Free Random Graph

Combinatorica
The powerrank web link analysis algorithm

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Discovering large dense subgraphs in massive graphs

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Power-Law Distributions in Empirical Data

SIAM Review
Networks, Crowds, and Markets: Reasoning About a Highly Connected World

Networks, Crowds, and Markets: Reasoning About a Highly Connected World
A survey of models of the web graph

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the Buckley-Osthus implementation of preferential attachment and its ability to model the web host graph in two aspects. One is the degree distribution that we observe to follow the power law, as often being the case for real-world graphs. Another one is the two-dimensional edge distribution, the number of edges between vertices of given degrees. We fit a single "initial attractiveness" parameter a of the model, first with respect to the degree distribution of the web host graph, and then, absolutely independently, with respect to the edge distribution. Surprisingly, the values of a we obtain turn out to be nearly the same. Therefore the same model with the same value of the parameter a fits very well the two independent and basic aspects of the web host graph. In addition, we demonstrate that other models completely lack the asymptotic behavior of the edge distribution of the web host graph, even when accurately capturing the degree distribution. To the best of our knowledge, this is the first study confirming the ability of preferential attachment models to reflect the distribution of edges between vertices with respect to their degrees in a real graph of Internet.