Testing theories of preferential attachment in random networks of citations

被引:3
|
作者
Smolinsky, Lawrence [1 ]
Lercher, Aaron [2 ]
McDaniel, Andrew
机构
[1] Louisiana State Univ, Dept Math, Baton Rouge, LA 70803 USA
[2] Louisiana State Univ, LSU Lib, Baton Rouge, LA 70803 USA
关键词
citation analysis; network structures; Markov models;
D O I
10.1002/asi.23312
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article we examine 2 classic stochastic models of the accumulation of citations introduced by H.A. Simon and Derek John de Solla Price. These models each have 2 distinct aspects: growth, which is the introduction of new articles, and preferential attachment, which describes how established articles accumulate new citations. The attachment rules are the subtle portion of these models that supply the interesting explanatory power. Previous treatments included both aspects. Here we separate preferential attachment from the growth aspect of the model. This separation allows us to examine the results of the preferential attachment rules without confounding these with growth in the number of articles available to receive citations. We introduce the method using Markov chains. We show how to overcome the mathematical and computational complexity to obtain results. A comparison of Simon's and Price's rules are computed in 3 JournalCitationReports subject categories using articles published in the 1960s and allowed to accumulate citations to 1980. This comparison cannot be made through analysis of power laws.
引用
收藏
页码:2132 / 2145
页数:14
相关论文
共 50 条
  • [1] Random and preferential attachment networks with aging
    Wu, JJ
    Gao, ZY
    Sun, HJ
    Huang, HJ
    [J]. CHINESE PHYSICS LETTERS, 2005, 22 (03) : 765 - 768
  • [2] Random Networks with Concave Preferential Attachment Rule
    Dereich S.
    Mörters P.
    [J]. Jahresbericht der Deutschen Mathematiker-Vereinigung, 2011, 113 (1) : 21 - 40
  • [3] RANDOM NETWORKS WITH SUBLINEAR PREFERENTIAL ATTACHMENT: THE GIANT COMPONENT
    Dereich, Steffen
    Moerters, Peter
    [J]. ANNALS OF PROBABILITY, 2013, 41 (01): : 329 - 384
  • [4] Random networks with sublinear preferential attachment: Degree evolutions
    Dereich, Steffen
    Moerters, Peter
    [J]. ELECTRONIC JOURNAL OF PROBABILITY, 2009, 14 : 1222 - 1267
  • [5] Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms
    Tiandong Wang
    Panpan Zhang
    [J]. Annals of the Institute of Statistical Mathematics, 2022, 74 : 957 - 986
  • [6] Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms
    Wang, Tiandong
    Zhang, Panpan
    [J]. ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 2022, 74 (05) : 957 - 986
  • [7] THE PREFERENTIAL ATTACHMENT MECHANISM BASING ON WEIGHTED PAST CITATIONS
    Wang, Mingyang
    Yu, Guang
    Yu, Daren
    [J]. INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 2011, 25 (15): : 2055 - 2061
  • [8] A Random Mapping With Preferential Attachment
    Hansen, Jennie C.
    Jaworski, Jerzy
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2009, 34 (01) : 87 - 111
  • [9] Random Preferential Attachment Hypergraph
    Avin, Chen
    Lotker, Zvi
    Nahum, Yinon
    Peleg, David
    [J]. PROCEEDINGS OF THE 2019 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2019), 2019, : 398 - 405
  • [10] Preferential Attachment and the Search for Successful Theories
    Alexander, J. McKenzie
    [J]. PHILOSOPHY OF SCIENCE, 2013, 80 (05) : 769 - 782