Dylan Walker et al J. Stat. Mech. (2007) P06010 doi:10.1088/1742-5468/2007/06/P06010
Dylan Walker1,2, Huafeng Xie2,3, Koon-Kiu Yan1,2 and Sergei Maslov2
Show affiliationsTo account for strong ageing characteristics of citation networks, we modify the PageRank algorithm by initially distributing random surfers exponentially with age, in favour 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 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 between 1893 and 2003 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. The advantages and performance of CiteRank over more conventional methods of ranking publications are discussed.
E-print Number: physics/0612122
Cited: by |
Refers: to
89.20.Hh World Wide Web, Internet
84.40.Ua Telecommunications: signal transmission and processing; communication satellites
68M10 Network design and communication (See also 68R10, 90B18)
Issue 06 (June 2007)
Received 27 December 2006, accepted for publication 24 May 2007
Published 14 June 2007
Dylan Walker et al J. Stat. Mech. (2007) P06010
Michele Leone et al J. Stat. Mech. (2006) P12012
Ram Brustein and Amos Yarom J. Stat. Mech. (2008) P07025
E Ben-Naim et al J. Stat. Mech. (2006) P07001
Miquel Montero J. Stat. Mech. (2007) P04002
John Ardelius et al J. Stat. Mech. (2007) P10012
Iwan Jensen J. Stat. Mech. (2004) P10008
R-D Herzberg et al 2006 Phys. Scr. 2006 73
Joachim Krug J. Stat. Mech. (2007) P07001
J C Woicik et al 2005 Phys. Scr. 2005 620