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
- Fakultät/Lehrstuhl
- Autorin(nen)/Autor(en)
- Markovich, Natalia M.
- Titel des Sammelwerks
- Distributed Computer and Communication Networks: Control, Computation, Communications : 24th International Conference, DCCN 2021, Moscow, Russia, September 20–24, 2021, Revised Selected Papers
- Herausgeberin(nen)/Herausgeber des Sammelwerks
- Vishnevskiy, Vladimir M.Samouylow, Konstantin E.Kozyrev, Dmitry V.
- Konferenz
- 24th International Conference, DCCN 2021, September 20–24, 2021, Moscow, Russia
- Verlagsangabe
- Springer : Cham
- Erscheinungsjahr
- 2021
- ISBN
- 978-3-030-92506-2
- Sprache(n)
- Englisch
- 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.
- Freie Schlagwort(e)
- PageRank vectorScale-free networkLinear preferential attachment
- Internationale Verbreitung
- ja
- Dokumenttyp
- Konferenzveröffentlichung
- URI
- Datum der Freischaltung
- 21.12.2021