Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

Home › Publications › The PageRank Vector of a Scale-Free Web Network Growing by Preferential Attachment

Publication

The PageRank Vector of a Scale-Free Web Network Growing by Preferential Attachment

Markovich, Natalia M.; Krieger, Udo R. (2021): The PageRank Vector of a Scale-Free Web Network Growing by Preferential Attachment, in: Vladimir M. Vishnevskiy, Konstantin E. Samouylow, und Dmitry V. Kozyrev (Hrsg.), Distributed Computer and Communication Networks: Control, Computation, Communications : 24th International Conference, DCCN 2021, Moscow, Russia, September 20–24, 2021, Revised Selected Papers, Cham: Springer, S. 24–31, doi: 10.1007/978-3-030-92507-9_3.

Details

Faculty/Chair
Faculty/Professorship
Author
Markovich, Natalia M.
Title of the compilation
Distributed Computer and Communication Networks: Control, Computation, Communications : 24th International Conference, DCCN 2021, Moscow, Russia, September 20–24, 2021, Revised Selected Papers
Editors
Vishnevskiy, Vladimir M.
Samouylow, Konstantin E.
Kozyrev, Dmitry V.
Conference
24th International Conference, DCCN 2021, September 20–24, 2021, Moscow, Russia
Publisher Information
Springer : Cham
Year of publication
2021
ISBN
978-3-030-92506-2
Language
English
DOI
Abstract

We consider a scale-free model of the Web network that is evolving by preferential attachment schemes and derive an explicit formula of its PageRank vector. Its element indicates the probability that a surfer resides at a related Web page i in a stationary regime of an associated random walk. Considering the growth of a directed Web graph, we apply linear preferential attachment schemes proposed by Samorodnitsky et al. (2016). To express the probability of a connection between two nodes of this Web graph, our derivation allows us to avoid the consideration of complicated paths with random lengths and to cover both self-loops and multiple edges between nodes. An algorithm of the PageRank vector calculation for graphs without loops is provided. The approach can be extended in a similar way to graphs with loops. In this way, our approach enhances existing analysis schemes. It provides a better insight on the PageRank of growing scale-free Web networks and supports the adaptation of the model to gathered network statistics.

Keywords
PageRank vector
Scale-free network
Linear preferential attachment
International Distribution
yes
Type
Conferenceobject
URI
Activation date
2021-12-21

Permalink: https://fis.uni-bamberg.de/handle/uniba/52563 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-16

Restricted read-only access: login, editing and submission are temporarily disabled.