Ranking Scientific Publications Using a Simple Model of Network Traffic

by: Dylan Walker, Huafeng Xie, Koon-Kiu Yan, Sergei Maslov

(13 Dec 2006)

View FullText article

arXiv (abstract), arXiv (PDF)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

logics of knowledge (group), dwinston, Social Tagging (group), Semantic-Social-Networks (group), complex networks (group), dylanwalker, A_Olympia, pdlug, Philosophy_of_Information (group), Blog_and_Wiki_Research (group)

Find related articles with these CiteULike tags

bibliometrics, citationnetworks, citations, citerank, metric, no-tag, publications, ranking, science, scientific

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.

@misc{citerank, 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.}, author = {Walker, Dylan and Xie, Huafeng and Yan, Koon-Kiu and Maslov, Sergei }, citeulike-article-id = {1189220}, eprint = {physics/0612122}, month = {Dec}, posted-at = {2008-06-23 18:24:40}, priority = {0}, title = {Ranking Scientific Publications Using a Simple Model of Network Traffic}, url = {http://arxiv.org/abs/physics/0612122}, year = {2006} }

RIS record

TY - ELEC ID - citerank L3 - citeulike-article-id:1189220 TI - Ranking Scientific Publications Using a Simple Model of Network Traffic N2 - 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. AU - Walker, Dylan AU - Xie, Huafeng AU - Yan, Koon-Kiu AU - Maslov, Sergei PY - 2006/Dec/13/ UR - http://arxiv.org/abs/physics/0612122 ER -

RIS BibTeX