short-paper

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

Authors:

Maxim Zhukovskiy,

Dmitry Vinogradov,

Liudmila Ostroumova,

Evgeniy Grechnikov,

Pavel Serdyukov, and

Andrei RaigorodskiiAuthors Info & Claims

CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management

October 2012

Pages 1577 - 1581

https://doi.org/10.1145/2396761.2398476

Published: 29 October 2012 Publication History

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.

References

[1]

L Barabási, R Albert. Emergence of scaling in random networks. Science 286, 509--512, 1999.

[2]

E. A. Bender, E. R. Canfield. The asymptotic number of labeled graphs with given degree sequences. J. Combin. Theory A 24, 296--307, 1978.

[3]

S. Boccaletti, et al. Complex networks: Structure and dynamics, Physics Reports 424, 175--308, 2006.

[4]

B. Bollobás, et al. The degree sequence of a scale-free random graph process. Random Structures and Algorithms, 18:3, 279--290, 2001.

[5]

B. Bollobás, O. M. Riordan. The diameter of a scale-free random graph. Combinatorica, 24:1, 5--34, 2004.

[6]

A. Bonato. A Survey of Models of the Web Graph. Proc. CAAN 2004, LNCS 3405, pp. 159--172, 2005.

[7]

A. Broder et al. Graph structure in the web. Proc. 9th WWW, 2000.

Digital Library

[8]

P. G. Buckley, D. Osthus. Popularity based random graph models leading to a scale-free degree sequence. Discrete Math. 282 (2004), 53--68.

[9]

A. Clauset et al. Power-Law Distributions in Empirical Data, SIAM review, 51(4), pp. 661--703, 2009.

[10]

S. N. Dorogovtsev, et al. Structure of growing networks with preferential linking, Phys. Rev. Lett. 85 (2000), 4633.

[11]

E. Drinea et al. Variations on random graph models for the web, technical report, Harvard University, 2001.

[12]

D. Easley, J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010.

[13]

D. Gibson et al. Discovering Large Dense Subgraphs in Massive Graphs, Proc. 31th VLDB, pp. 721--732, 2005.

Digital Library

[14]

E. A. Grechnikov. The degree distribution and the number of edges between vertices of given degrees in the Buckley-Osthus model of a random web graph, J of Internet Mathematics, accepted. arXiv:1108.4054v1, 2011.

[15]

P. Holme, B. J. Kim. Growing scale-free networks with tunable clustering, Phys. Rev. E, vol. 65(2), 026107, 2002.

[16]

R. Kumar et al. Web as a graph, Proc. PODS 2000, pp. 1--10, 2000.

Digital Library

[17]

M. E. J. Newman. Assortative mixing in networks. Phys Rev Lett 89(20), 208701, 2002.

[18]

R. Pastor-Satorras et al. Dynamical and Correlation Properties of the Internet, Phys Rev Lett 87, 258701, 2001.

[19]

Y. Lu et al. The PowerRank Web Link Analysis Algorithm, Proc. 13th WWW, 2004.

Cited By

Di ZWang GJia LChen Z(2022)Bitcoin transactions as a graphIET Blockchain10.1049/blc2.120162:3-4(57-66)Online publication date: 8-Sep-2022
https://doi.org/10.1049/blc2.12016
Masterton GOlsson E(2017)From Impact to Importance: The Current State of the Wisdom-of-Crowds Justification of Link-Based Ranking AlgorithmsPhilosophy & Technology10.1007/s13347-017-0274-2Online publication date: 16-Aug-2017
https://doi.org/10.1007/s13347-017-0274-2
Raigorodskii A(2016)Models of Random Graphs and Their Applications to the Web-Graph AnalysisInformation Retrieval10.1007/978-3-319-41718-9_5(101-118)Online publication date: 26-Jul-2016
https://doi.org/10.1007/978-3-319-41718-9_5
Show More Cited By

Index Terms

Empirical validation of the buckley-osthus model for the web host graph: degree and edge distributions
1. Computing methodologies
  1. Modeling and simulation
    1. Model development and analysis
      1. Model verification and validation
2. Mathematics of computing
  1. Probability and statistics
    1. Distribution functions
    2. Stochastic processes

Recommendations

A generalization of the Buckley-Osthus model for web graphs

We generalize the web graph models of Buckley and Osthus (2004) and Wu et al. (2009) to a directed version in the manner of Bollobas et al. (2003) and Cooper and Frieze (2003). The graph evolution process is a mixture of five steps. The degree ...
Read More
A random growth model with any real or theoretical degree distribution
Abstract
The degree distributions of complex networks are usually considered to follow a power law distribution. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (...
Read More
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 ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management

October 2012

2840 pages

ISBN:9781450311564

DOI:10.1145/2396761

General Chair:
Xuewen Chen
Wayne State University, USA
,
Program Chairs:
Guy Lebanon
Georgia Institute of Technology
,
Haixun Wang
Microsoft Research Asia
,
Mohammed J. Zaki
Rensselaer Polytechnic Institute

Copyright © 2012 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 October 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Conference

CIKM'12

Sponsor:

CIKM'12: 21st ACM International Conference on Information and Knowledge Management

October 29 - November 2, 2012

Hawaii, Maui, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
124
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)1

Other Metrics

View Author Metrics

Citations

Cited By

Di ZWang GJia LChen Z(2022)Bitcoin transactions as a graphIET Blockchain10.1049/blc2.120162:3-4(57-66)Online publication date: 8-Sep-2022
https://doi.org/10.1049/blc2.12016
Masterton GOlsson E(2017)From Impact to Importance: The Current State of the Wisdom-of-Crowds Justification of Link-Based Ranking AlgorithmsPhilosophy & Technology10.1007/s13347-017-0274-2Online publication date: 16-Aug-2017
https://doi.org/10.1007/s13347-017-0274-2
Raigorodskii A(2016)Models of Random Graphs and Their Applications to the Web-Graph AnalysisInformation Retrieval10.1007/978-3-319-41718-9_5(101-118)Online publication date: 26-Jul-2016
https://doi.org/10.1007/978-3-319-41718-9_5
Pushnyakov PGusev GChung CBroder AShim KSuel T(2014)User profiles based on revisitation timesProceedings of the 23rd International Conference on World Wide Web10.1145/2567948.2577380(359-360)Online publication date: 7-Apr-2014
https://dl.acm.org/doi/10.1145/2567948.2577380
Kupavskii AOstroumova LShabanov DTetali P(2013)The Distribution of Second Degrees in the Buckley–Osthus Random Graph ModelInternet Mathematics10.1080/15427951.2012.7273759:4(297-335)Online publication date: 2-Oct-2013
https://doi.org/10.1080/15427951.2012.727375

View Options

Get Access

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents