Concentration of vertex degrees in a scale-free random graph process
Authors:
- Jerzy Stanisław Szymański
Abstract
The web may be viewed as a directed graph each of whose vertices is a static HTML Web page, and each of whose edges corresponds to a hyperlink from one Web page to another. In this paper we study the model of random graph (i.e., scale-free random graph process) introduced by Barabási and Albert and formalized by Bollobás, Riordan, Spencer, and Tusnády, which obey two properties known as power laws for vertex degrees and "small-world phenomenon." In the paper we give some exact formulas and fair estimations for expectations of the number of vertices of given degree and the degree of given vertex. Moreover, based on Hájek-Rényi inequality we give the rate of concentration of the number of vertices of given degree. © 2005 Wiley Periodicals, Inc.
- Record ID
- UAMbebad3e4a675414fa78a078219ac5f7a
- Author
- Journal series
- Random Structures & Algorithms, ISSN 1042-9832
- Issue year
- 2005
- Vol
- 26
- Pages
- 224-236
- ASJC Classification
- ; ; ;
- DOI
- DOI:10.1002/rsa.20065 Opening in a new tab
- Language
- (en) English
- Score (nominal)
- 0
- Score source
- journalList
- Publication indicators
- = 10; = 10; : 2005 = 1.399; : 2006 (2 years) = 1.167 - 2007 (5 years) =1.115
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAMbebad3e4a675414fa78a078219ac5f7a/
- URN
urn:amu-prod:UAMbebad3e4a675414fa78a078219ac5f7a
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.