Ranking Scientific Publications Using a Simple Model of Network Traffic

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.

4 pages, 3 figures

Cited by in corpus (8)

• Finding Scientific Gems with Google
• Diffusion of scientific credits and the ranking of scientists
• Promise and Pitfalls of Extending Google's PageRank Algorithm to Citation Networks
• Nonuniversal power law scaling in the probability distribution of scientific citations
• Weighted citation: An indicator of an article's prestige
• Fractional counting of citations in research evaluation: An option for cross- and interdisciplinary assessments
• Fractional counting of citations in research evaluation: A cross- and interdisciplinary assessment of the Tsinghua University in Beijing
• A recursive field-normalized bibliometric performance indicator: An application to the field of library and information science