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

@article{Zhukovskiy2012EmpiricalVO,
  title={Empirical validation of the buckley-osthus model for the web host graph: degree and edge distributions},
  author={Maxim Zhukovskiy and Dmitry V. Vinogradov and Yuri Pritykin and Liudmila Ostroumova and Evgeny A. Grechnikov and Gleb Gusev and Pavel Serdyukov and Andrei M. Raigorodskii},
  journal={Proceedings of the 21st ACM international conference on Information and knowledge management},
  year={2012}
}
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… 

Figures and Tables from this paper

The Distribution of Second Degrees in the Buckley–Osthus Random Graph Model
TLDR
This article considers a well-known generalization of the Barabási and Albert preferential attachment model—the Buckley–Osthus model and proves that the second degrees also obey a power law.
Sampling and inference in complex networks
TLDR
Algorithms based on random walks and diffusion for sampling, estimation and inference of the network functions, and for approximating the spectrum of graph matrices are designed and analyzed.
Distribution of small subgraphs in Buckley–Osthus random graphs
We study a random graph model similar to the Buckley– Osthus preferential attachment model and develop a technique for estimating the expectation of a wide class of random variables in this model. By
Distribution and dependence of extremes in network sampling processes
TLDR
This work abstracts the dependence and the statistics of extremes into a single parameter that appears in extreme value theory called extremal index (EI), and proposes the use of EI as a parameter to compare different sampling procedures.
Assortativity in Generalized Preferential Attachment Models
TLDR
Assortativity of preferential attachment models is analyzed by analyzing the behavior of \(d_{nn}(d)\) which is the average degree of a neighbor of a vertex of degree d.
Models of Random Graphs and Their Applications to the Web-Graph Analysis
This course provides an overview of various models for random graphs and their applications to the Web graph. We start with the classical Erdős-Renyi model, then proceed with the most recent models
From Impact to Importance: The Current State of the Wisdom-of-Crowds Justification of Link-Based Ranking Algorithms
TLDR
It is argued that neither the influential preferential attachment models due to Barabási and Albert nor the recent model introduced by Masterton et al. allows for a satisfactory wisdom-of-crowds justification of PageRank, and it is suggested that future work should explore “dual models” of linking on the web, i.e., models that combine the two previous approaches.
Sampling and inference in complex networks
TLDR
This thesis focuses on the use of sampling to infer non-trivial properties of the network itself – both structural and functional and introduces a sampling technique, based on concepts from expander graphs, to infer aspects of community structure in the larger network.
Social Networks Modelling: The Case Of Virtual Buddhist Communities
Social media has become an environment for the emergence of new forms of religious activity. They are a very promising field for the sociological research of religious activity and identity.
Small subgraphs in preferential attachment networks
TLDR
An overview of old and new results on the global and average local clustering coefficients as well as on the distribution of small subgraphs in the Bollobás–Riordan and Buckley–Osthus models of web graphs.
...
...

References

SHOWING 1-10 OF 46 REFERENCES
Popularity based random graph models leading to a scale-free degree sequence
Stochastic models for the Web graph
TLDR
The results are two fold: it is shown that graphs generated using the proposed random graph models exhibit the statistics observed on the Web graph, and additionally, that natural graph models proposed earlier do not exhibit them.
The Web as a Graph: Measurements, Models, and Methods
TLDR
This paper describes two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery, and proposes a new family of random graph models that point to a rich new sub-field of the study of random graphs, and raises questions about the analysis of graph algorithms on the Internet.
The degree sequence of a scale‐free random graph process
TLDR
Here the authors obtain P(d) asymptotically for all d≤n1/15, where n is the number of vertices, proving as a consequence that γ=3.9±0.1 is obtained.
The powerrank web link analysis algorithm
TLDR
A novel link analysis algorithm "the PowerRank algorithm", which makes use of the power law distribution attribute and the hierarchy structure of the web graph, which computes 10%-30% faster than PageRank algorithm.
Origin of degree correlations in the Internet and other networks.
  • Juyong ParkM. Newman
  • Geology
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
TLDR
The results confirm that the conjectured mechanism does indeed give rise to correlations of the kind seen in the Internet, although only a part of the measured correlation can be accounted for in this way.
The Diameter of a Scale-Free Random Graph
We consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number m of earlier vertices, where each earlier vertex is chosen with probability
Structure of growing networks with preferential linking.
TLDR
The model of growing networks with the preferential attachment of new links is generalized to include initial attractiveness of sites and it is shown that the relation beta(gamma-1) = 1 between the exponents is universal.
Assortative model for social networks.
TLDR
A version of a network growth model, generalized in order to describe the behavior of social networks, one of the few able to reproduce such behavior, giving some insight on the microscopic dynamics at the basis of the graph structure.
Directed scale-free graphs
TLDR
A model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees is introduced, reproducing observed properties of the worldwide web.
...
...