On the initial value of PageRank

Abstract

Google employs PageRank to rank web pages, determining the order in which search results are presented to users based on their queries. PageRank is primarily utilized for directed networks, although there are instances where it is also applied to undirected networks. In this paper, we have applied PageRank to undirected networks, showing that a vertex's PageRank relies on its initial value, often referred to as an intrinsic, non-network contribution. We have analytically proved that when the initial value of vertices is either proportional to their degrees or set to zero, the PageRank values of the vertices become directly proportional to their degrees. Simulated and empirical data are employed to bolster our research findings. Additionally, we have investigated the impact of initial values on PageRank localization.

12 pages, 16 figures

References in corpus (8)

• Cooperative Game Theory Approaches for Network Partitioning
• Anderson Transitions
• Localization and centrality in networks
• Random walks on networks with stochastic resetting
• Random walks on complex networks with first-passage resetting
• From classical to quantum walks with stochastic resetting on networks
• Random walks on complex networks under node-dependent stochastic resetting
• Random walks on complex networks under time-dependent stochastic resetting