Ranking Scientific Publications Using a Simple Model of Network Traffic
Dylan Walker, Huafeng Xie, Koon-Kiu Yan, Sergei Maslov
Abstract
To account for strong aging characteristics of citation networks, we modify Google's PageRank algorithm by initially distributing random surfers exponentially with age, in favor of more recent publications. The output of this algorithm, which we call CiteRank, is interpreted as approximate traffic to individual publications in a simple model of how researchers find new information. We develop an analytical understanding of traffic flow in terms of an RPA-like model and optimize parameters of our algorithm to achieve the best performance. The results are compared for two rather different citation networks: all American Physical Society publications and the set of high-energy physics theory (hep-th) preprints. Despite major differences between these two networks, we find that their optimal parameters for the CiteRank algorithm are remarkably similar.
Create a lesson
Related papers
Distinct routes to phase transitions in spatial activation systems
Jialu Zhang, Guanyu Zhang, Leyang Xue et al.
District-Level Food Environment Indicators and Social Vulnerability in São Paulo
Pedro Lemes Sixel Lobo, Eric Tokuda, Kuruvilla Joseph Abraham et al.
Prompt Sensitivity of Generative Agents: Evidence from an Epidemic Model
Ross Williams, Niyousha Hosseinichimeh
Giant strongly biconnected components of directed networks: a generating function approach
Minsoo Yang, Reinhard Laubenbacher, Byungjoon Min
(k,n)-core percolation on hypergraphs with anchor nodes
Hoseung Jang, Byungjoon Min, Ginestra Bianconi
The complex relationship between anti-immigrant sentiment and exposure in the Netherlands
Benedikt Meylahn, Tommaso Giommoni, Mike Lees et al.