Skip to main content
PLOS ONE logoLink to PLOS ONE
. 2011 Sep 22;6(9):e24926. doi: 10.1371/journal.pone.0024926

Characterizing and Modeling Citation Dynamics

Young-Ho Eom 1, Santo Fortunato 1,*
Editor: Matjaz Perc2
PMCID: PMC3178574  PMID: 21966387

Abstract

Citation distributions are crucial for the analysis and modeling of the activity of scientists. We investigated bibliometric data of papers published in journals of the American Physical Society, searching for the type of function which best describes the observed citation distributions. We used the goodness of fit with Kolmogorov-Smirnov statistics for three classes of functions: log-normal, simple power law and shifted power law. The shifted power law turns out to be the most reliable hypothesis for all citation networks we derived, which correspond to different time spans. We find that citation dynamics is characterized by bursts, usually occurring within a few years since publication of a paper, and the burst size spans several orders of magnitude. We also investigated the microscopic mechanisms for the evolution of citation networks, by proposing a linear preferential attachment with time dependent initial attractiveness. The model successfully reproduces the empirical citation distributions and accounts for the presence of citation bursts as well.

Introduction

Citation networks are compact representations of the relationships between research products, both in the sciences and the humanities [1], [2]. As such they are a valuable tool to uncover the dynamics of scientific productivity and have been studied for a long time, since the seminal paper by De Solla Price [3]. In the last years, in particular, due to the increasing availability of large bibliographic data and computational resources, it is possible to build large networks and analyze them to an unprecedented level of accuracy.

In a citation network, each vertex represents a paper and there is a directed edge from paper Inline graphic to paper Inline graphic if Inline graphic includes Inline graphic in its list of references. Citation networks are then directed, by construction, and acyclic, as papers can only point to older papers, so directed loops cannot be obtained. A large part of the literature on citation networks has focused on the characterization of the probability distribution of the number of citations received by a paper, and on the design of simple microscopic models able to reproduce the distribution. The number of citations of a paper is the number of incoming edges (indegree) Inline graphic of the vertex representing the paper in the citation network. So the probability distribution of citations is just the indegree distribution Inline graphic. There is no doubt that citation distributions are broad, as there are papers with many citations together with many poorly cited (including many uncited) papers. However, as of today, the functional shape of citation distributions is still elusive. This is because the question is ill-defined. In fact, one may formulate it in a variety of different contexts, which generally yield different answers. For instance, one may wish to uncover the distribution from the global citation network including all papers published in all journals at all times. Otherwise, one may wish to specialize the query to specific disciplines or years. The role of the discipline considered is important and is liable to affect the final result. For instance, it is well known that papers in Biology are, on average, much more cited than papers in Mathematics. One may argue that this evidence may still be consistent with having similar functional distributions for the two disciplines, defined on ranges of different sizes. Also, the role of time is important. It is unlikely that citation distributions maintain the exact same shape regardless of the specific time window considered. The dynamics of scientific production has changed considerably in the last years. It is well known, for instance, that the number of published papers per year has been increasing exponentially until now [4]. This, together with the much quicker publication times of modern journals, has deeply affected the dynamics of citation accumulation of papers. Moreover, if the dataset at study includes papers published in different years, older papers tend to have more citations than recent ones just because they have been exposed for a longer time, not necessarily because they are better works: the age of a paper is an important factor.

So, the question of which function best describes the citation distributions is meaningless if one does not define precisely the set of publications examined. Redner [5] considered all papers published in Physical Review D up to Inline graphic, along with all articles indexed by Thomson Scientific in the period Inline graphicInline graphic, and found that the right tail of the distribution, corresponding to highly cited papers, follows a power law with exponent Inline graphic, in accord with the conclusions of Price [3]. Laherrére and Sornette [6] studied the top Inline graphic most cited physicists during the period Inline graphicInline graphic, whose citation distribution is more compatible with a stretched exponential Inline graphic, with Inline graphic. Tsallis and de Albuquerque [7] analyzed the same datasets used by Redner with an additional one including all papers published up to Inline graphic in Physical Review E, and found that the Tsallis distribution Inline graphic, with Inline graphic and Inline graphic, consistently fits the whole distribution of citations (not just the tail). More recently Redner performed an analysis over all papers published in the Inline graphic years long history of journals of the American Physical Society (APS) [8], concluding that the log-normal distribution

graphic file with name pone.0024926.e021.jpg (1)

is more adequate than a power law. In other studies distributions of citations have been fitted with various functional forms: power-law [9][14], log-normal [12], [15], [16], Tsallis distribution [17], [18], modified Bessel function [19], [20] or more complicated distributions [21].

In this paper we want to examine citation networks more in depth. We considered networks including all papers and their mutual citations within several time windows. We have performed a detailed analysis of the shape of the distributions, by computing the goodness of fits with Kolmogorov-Smirnov statistics of three model functions: simple power law, shifted power law and log-normal. Moreover, we have also examined dynamic aspects of the process of citation accumulation, revealing the existence of “bursts”, i.e. of rapid accretions of the number of citations received by papers. Citation bursts are not compatible with standard models of citation accumulation based on preferential attachment [22], in which the accumulation is smooth and papers may attract many cites long after publication. Therefore, we propose a model in which the citation attractiveness of a paper depends both on the number of cites already collected by the paper and on some intrinsic attractiveness that decays in time. The resulting picture delivers both the citation distribution and the presence of bursts.

Results

The distribution of cites

For our analysis we use the citation database of the American Physical Society (APS), described in Materials and Methods. We get the best fit for the empirical citation distributions from the goodness of fit test with Kolmogorov-Smirnov (KS) statistics [23]. The KS statistic Inline graphic is the maximum distance between the cumulative distribution function (CDF) of the empirical data and the CDF of the fitted model:

graphic file with name pone.0024926.e023.jpg (2)

Here Inline graphic is the CDF of the empirical indegree Inline graphic and Inline graphic is the CDF of the model that fits best the empirical data in the region Inline graphic. By searching the parameter space, the best hypothetical model is the one with the least value of Inline graphic from the empirical data. To test the statistical significance of the hypothetical model, we cannot use the values of the KS statistics directly though, as the model has been derived from a best fit on the empirical data, rather than being an independent hypothesis. So, following Ref. [23] we generate synthetic datasets from the model corresponding to the best fit curve. For instance, if the best fit is the power law Inline graphic, the datasets are generated from this distribution. Each synthetic dataset will give a value Inline graphic for the KS statistics between the dataset and the best fit curve. These Inline graphic-values are compared with Inline graphic, i.e. the Inline graphic-value between the original empirical data and the best fit curve, in order to define a Inline graphic-value. The Inline graphic-value is the fraction of Inline graphic-values larger than Inline graphic. If Inline graphic is large (close to 1), the model is a plausible fit to the empirical data; if it is close to Inline graphic, the hypothetical model is not a plausible fit. We applied this goodness of fit test to three hypothetical model distributions: log-normal, simple power law and shifted power law. The log-normal distribution for the indegree Inline graphic is given by

graphic file with name pone.0024926.e041.jpg (3)

the simple power law distribution by

graphic file with name pone.0024926.e042.jpg (4)

and the shifted power law by

graphic file with name pone.0024926.e043.jpg (5)

We used Inline graphic synthetic distributions to calculate the Inline graphic-value for each empirical distribution.

Fig. 1 shows some fits for datasets corresponding to several time windows (see Materials and Methods). The detailed summary of the goodness of fit results is shown in Table 1. The simple power law gives high Inline graphic-value only when one considers the right tail of the distribution (usually Inline graphic). The log-normal distribution gives high Inline graphic-value for early years (before 1970) but after 1970 the p-value is smaller than 0.2. As shown in Figs. 1a and 1b, there is a clear discrepancy in the tail between the best fit log-normal distribution and the empirical distribution. The shifted power law distribution gives significant p-values (higher than 0.2) for all observation periods. The values of the exponent Inline graphic of the shifted power law are decreasing in time. The range of Inline graphic goes from Inline graphic (Inline graphic) to Inline graphic (Inline graphic).

Figure 1. Empirical citation distributions and best fit model distributions obtained through the goodness of fit with Komolgorov-Smirnov statistics.

Figure 1

PL: Power law. SPL: Shifted power law. LN: Log-normal.

Table 1. Summary of the results of the goodness of fit test with Kolmogorov-Smirnov statistic on the empirical citation distributions for three test functions: log-normal (LN), simple power law (PL) and shifted power law (SPL).

1950 1955 1960 1965 1970 1975 1980 1985 1990 1995 2000 2005 2008
LN
p-value 0.717 0.734 0.892 0.998 0.201 0.105 0.19 0.119 0.194 0.194 0.096 0.05 0.064
Inline graphic 2 3 7 14 2 2 2 3 2 2 2 2 2
PL
p-value 0.001 0.955 0.056 0.321 0.022 0.127 0.204 0.784 0.686 0.412 0.362 0.619 0.44
Inline graphic 6 16 9 19 12 17 20 39 46 39 43 47 47
SPL
p-value 0.832 0.777 0.49 1.00 0.943 0.958 0.49 0.728 0.909 1.00 0.797 0.989 0.99
Inline graphic 2 2 2 14 9 12 2 2 2 2 3 6 5

The fits are done for indegree larger than Inline graphic, whose values are also reported in the table.

We conclude that the shifted power law is the best distribution to fit the data.

The distribution of citation bursts

We now turn our attention to citation “bursts”. While there has been a sizeable activity in the analysis of bursty behavior in human dynamics [24][26], we are not aware of similar investigations for citation dynamics. We compute the relative rate Inline graphic, where Inline graphic is the number of citations of paper Inline graphic at time Inline graphic. The distributions of Inline graphic with Inline graphic, Inline graphic, Inline graphic, Inline graphic and Inline graphic year are shown in Fig. 2a. They are visibly broad, spanning several orders of magnitude. Similar heavy tails of burst size distributions were observed in the dynamics of popularity in Wikipedia and the Web [27]. It is notable that the largest bursts take place in the first years after publication of a paper. This is manifest in Fig. 2b, where we show distributions derived from the same dataset as in Fig. 2a, but including only papers older than Inline graphic (squares) and Inline graphic years (triangles): the tail disappears. In general, more than Inline graphic of large bursts (Inline graphic) occur within the first Inline graphic years since publication.

Figure 2. Distributions of citation burst size.

Figure 2

(a) The four curves correspond to Inline graphic, Inline graphic, Inline graphic and Inline graphic, the observation window is Inline graphic year. (b) Here the reference year is Inline graphic, but the burst statistics is limited to the papers published until Inline graphic (squares) and Inline graphic (triangles). For comparison, the full curve comprising all papers (circles, as in (a)) is also shown.

Preferential attachment and age-dependent attractiveness

For many growing networks, cumulative advantage [28], [29], or preferential attachment [22], has proven to be a reliable mechanism to explain the fat-tailed distributions observed. In the context of citation dynamics, it is reasonable to assume that, if a paper is very cited, it will have an enhanced chance to receive citations in the future with respect to poorly cited papers. This can be formulated by stating that the probability that a paper gets cited is proportional to the number of citations it already received. That was the original idea of Price [30] and led to the development of the first dynamic mechanism for the generation of power law distributions in citation networks. In later refinements of the model, one has introduced an attractiveness for the vertices, indicating their own appeal to attract edges, regardless of degree. In particular, one has introduced the so-called linear preferential attachment [31], [32], in which the probability for a vertex to receive a new edge is proportional to the sum of the attractiveness of the vertex and its degree. In this Section we want to check whether this hypothesis holds for our datasets. This issue has been addressed in other works on citation analysis, like Refs. [13], [33].

We investigated the dependence of the kernel function Inline graphic on indegree Inline graphic [34], [35]. The kernel is the rate with which a vertex Inline graphic with indegree Inline graphic acquires new incoming edges. For linear preferential attachment the kernel is

graphic file with name pone.0024926.e086.jpg (6)

In Eq. 6 the constant Inline graphic indicates the attractiveness of vertex Inline graphic. Computing the kernel directly for each indegree class (i.e. for all vertices with equal indegree Inline graphic) is not ideal, as the result may heavily fluctuate for large values of the indegree, due to poor statistics. So, following Refs. [34], [35], we consider the cumulative kernel Inline graphic, which, for the ansatz of Eq. 6, should have the following functional dependence on Inline graphic

graphic file with name pone.0024926.e092.jpg (7)

In Eq. 7 Inline graphic is the average attractiveness of the vertices. In order to estimate Inline graphic, we need to compute the probability that vertices with equal indegree have gotten edges over a given time window, and sum the results over all indegree values from the smallest one to a given Inline graphic. The time window has to be small enough in order to preserve the structure of the network but not too small in order to have enough citation statistics. In Fig. 3 we show the cumulative kernel function Inline graphic as a function of indegree for a time window from Inline graphic to Inline graphic. The profile of the curve (empty circles) is compatible with linear preferential attachment with an average attractiveness Inline graphic over a large range, although the final part of the tail is missed. Still, the slope of the tail, apart from the final plateau, is close to Inline graphic, like in Eq. 7. Our result is consistent with that of Jeong et al. [34], who considered a citation network of papers published in Physical Review Letters in 1988, which are part of our dataset as well. We have repeated this analysis for several datasets, from Inline graphic until Inline graphic, by keeping a time window of one year in each case. The resulting values of Inline graphic are reported in Table 2, along with the number of vertices and mean degree of the networks. The average value of the attractiveness across all datasets is Inline graphic. This value is much bigger than the average indegree in the early ages of the network like, for example, from Inline graphic to Inline graphic. Hence, in the tradeoff between indegree and attractiveness of Eq. 6, the latter is quite important for old papers. In general, for low indegrees, attractiveness dominates over preferential attachment. As we see in Fig. 3, in fact, for low indegrees there is no power law dependence of the kernel on indegree.

Figure 3. Cumulative kernel function of the citation network from 2007 to 2008.

Figure 3

The continuous line is Inline graphic with Inline graphic, Inline graphic is a constant. The dashed line corresponds to the case without attractiveness (Inline graphic).

Table 2. Statistics of the empirical citation networks: Inline graphic is the number of vertices in the network; Inline graphic is the average indegree of the network; Inline graphic is the average attractiveness, determined from the tests of linear preferential attachment discussed in the text.

1950 1955 1960 1965 1970 1975 1980 1985 1990 1995 2000 2005 2008
Inline graphic 15880 23350 30996 42074 62382 85590 108794 138206 180708 238142 305570 386569 441595
Inline graphic 2.2 3.1 3.7 4.3 5.1 5.6 6.0 6.2 6.5 7.0 7.7 8.5 9.0
Inline graphic 4.2 5.3 6.2 5.4 7.2 7.9 7.8 9.0 7.4 7.3 6.8 6.4 7.0

Finally we investigated the time dependence of the kernel. As shown in Fig. 3, when we limit the analysis to papers older than 5 years (squares) or 10 years (triangles), the kernel has a pure quadratic dependence on indegree in the initial part, without linear terms, so the attractiveness does not affect the citation dynamics. This means that the attractiveness has a significant influence on the evolution of the citation network only within the first few years after publication of the papers. The presence of vertex attractiveness had been considered by Jeong et al. as well [34].

The model

We would like to design a microscopic model that reflects the observed properties of our citation networks. Preferential attachment does not account for the fact that the probability to receive citations may depend on time. In the Price model, for instance, papers keep collecting citations independently of their age, while it is empirically observed [33], [36], [37] that the probability for an article to get cited decreases as the age of the same article increases. In addition, we have seen that citation bursts typically occur in the early life of a paper. Some sophisticated growing network models include the aging of vertices as well [33], [37][40]. We propose a mechanism based on linear preferential attachment, where papers have individual values of the attractiveness, and the latter decays in time.

The model works as follows. At each time step Inline graphic, a new vertex joins the network (i.e., a new paper is published). The new vertex/paper has Inline graphic references to existing vertices/papers. The probability Inline graphic that the new vertex Inline graphic points to a target vertex Inline graphic with indegree Inline graphic reads

graphic file with name pone.0024926.e123.jpg (8)

where Inline graphic is the attractiveness of Inline graphic at time Inline graphic. If Inline graphic were constant and equal for all vertices we would recover the standard linear preferential attachment [31], [32]. We instead assume that it decays exponentially in time

graphic file with name pone.0024926.e128.jpg (9)

In Eq. 9 Inline graphic is the initial attractiveness of the vertex, and Inline graphic is the time in which the vertex first appears in the network; Inline graphic is the time scale of the decay, after which the attractiveness lowers considerably and loses importance for citation dynamics. Since citation bursts occur in the initial phase of a paper's life (Fig. 2b), when vertex attractiveness is most relevant, we expect that the values of the initial attractiveness are heterogeneously distributed, to account for the broad distribution of burst sizes (Fig. 2a). We assume the power law distribution

graphic file with name pone.0024926.e132.jpg (10)

We performed numerical simulations of the model with parameters obtained from the empirical data. We use Inline graphic, Inline graphic year and Inline graphic with Inline graphic is the number of papers at time Inline graphic. The upper bound represents the largest average indegree of our citation networks, expressed in terms of the number of vertices. The value of Inline graphic depends on the obtained value of the attractiveness from empirical data. We set Inline graphic for most years, for 1950 we set Inline graphic, because Inline graphic is smaller than Inline graphic. The result is however not very sensitive to the minimum and maximum value of Inline graphic. Fig. 4 shows the citation distributions of empirical data versus the model prediction. The model can reproduce the empirical distributions very well at different phases in the evolution of the APS citation network, from the remote Inline graphic (panel d) until the very recent Inline graphic (panel a).

Figure 4. Comparison of the citation distributions from the empirical data and our model.

Figure 4

For all cases, we used Inline graphic and Inline graphic year. (a) For Inline graphic, Inline graphic, Inline graphic. (b) For Inline graphic, Inline graphic, Inline graphic. (c) For Inline graphic, Inline graphic, Inline graphic. (d) For Inline graphic, Inline graphic, Inline graphic. Here Inline graphic is the number of vertices/papers and Inline graphic the average number of citations/indegree.

The distributions of citation burst magnitude Inline graphic for the data and the model are shown in Fig. 5a. For a better comparison between data and model we “evolve” the network according to the model by starting from the structure of the empirical citation network at the beginning of the time window for the detection of the bursts. We stop the evolution after the observation time Inline graphic elapses. In Fig. 5a we consider Inline graphic and Inline graphic, with a time window of Inline graphic year for the burst detection. The model successfully reproduces the empirical distributions of burst size. In Fig. 5b we consider much longer observation periods for the bursts, of Inline graphic and Inline graphic years. Still, the model gives an accurate description of the tail of the empirical curve in both cases.

Figure 5. Comparison of the distributions of citation burst size from the empirical data and the model.

Figure 5

The exponent Inline graphic of the distribution of initial attractiveness is Inline graphic, as in Fig. 4. (a) The reference years are Inline graphic (squares) and Inline graphic (circles), the observation window for the bursts is Inline graphic year in both cases. (b) Here the reference years are Inline graphic (squares) and Inline graphic (circles) and the observation windows for the bursts are of Inline graphic and Inline graphic years, respectively.

Discussion

We investigated citation dynamics for networks of papers published on journals of the American Physical Society. Kolmogorov-Smirnov statistics along with goodness of fit tests make us conclude that the best ansatz for the distribution of citations (from old times up to any given year) is a shifted power law. The latter beats both simple power laws, which are acceptable only on the right tails of the distributions, and log-normals, which are better than simple power laws on the left part of the curve, but are not accurate in the description of the right tails. We have also studied dynamic properties of citation flows, and found that the early life of papers is characterized by citation bursts, like already found for popularity dynamics in Wikipedia and the Web.

The existence of bursts is not compatible with traditional models based on preferential attachment, which are capable to account for the skewed citation distributions observed, but in which citation accumulation is smooth. Therefore we have introduced a variant of linear preferential attachment, with two new features: 1) the attractiveness decays exponentially in time, so it plays a role only in the early life of papers, after which it is dominated by the number of citations accumulated; 2) the attractiveness is not the same for all vertices but it follows a heterogeneous (power-law) distribution. We have found that this simple model is accurate in the description of the distributions of citations and burst sizes, across very different scientific ages. Moreover, the model is fairly robust with respect to the choice of the observation window for the bursts.

Materials and Methods

Our citation database includes all papers published in journals of the American Physical Society (APS) from 1893 to 2008, except papers published in Reviews of Modern Physics. There are 3 992 736 citations among 414 977 papers at the end of 2008. The journals we considered are Physical Review (PR), Physical Review Letters (PRL), Physical Review A (PRA), Physical Review B (PRB), Physical Review C (PRC), Physical Review D (PRD), Physical Review E (PRE), Physical Review - Series I (PRI), Physical Review Special Topics - Accelerators and Beams (PRSTAB), and Physical Review Special Topics - Physics Education Research (PRSTPER). From these data, we constructed time-aggregated citation networks from 1950 to a year Inline graphic, with Inline graphic.

Acknowledgments

We thank the American Physical Society for letting us use their citation database.

Footnotes

Competing Interests: The authors have declared that no competing interests exist.

Funding: This work was supported by the ICTeCollective, FET-Open grant number 238597 of the European Commission. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.

References

  • 1.Garfield E. Citation indexes for science: A new dimension in documentation through association of ideas. Science. 1955;122:108–111. doi: 10.1126/science.122.3159.108. [DOI] [PubMed] [Google Scholar]
  • 2.Garfield E. Its Theory and Applicationsins in Science, Technology and Humanities. New York, USA: Wiley; 1979. Citation Indexing. [Google Scholar]
  • 3.de Solla Price DJ. Networks of scientific papers. Science. 1965;169:510–515. doi: 10.1126/science.149.3683.510. [DOI] [PubMed] [Google Scholar]
  • 4.de Solla Price DJ. London: Yale University Press; 1975. Science since Babylon. [Google Scholar]
  • 5.Redner S. How popular is your paper? An empirical study of the citation distribution. Eur Phys J B. 1998;4:131–134. [Google Scholar]
  • 6.Laherrère J, Sornette D. Stretched exponential distributions in nature and economy: “fat tails” with characteristic scales. Eur Phys J B. 1998;2:525–539. [Google Scholar]
  • 7.Tsallis C, de Albuquerque MP. Are citations of scientific papers a case of nonextensivity? Eur Phys J B. 2000;13:777–780. [Google Scholar]
  • 8.Redner S. Citation Statistics from 110 Years of Physical Review. Physics Today. 2005;58:49–54. [Google Scholar]
  • 9.Seglen PO. The skewness of science. Journal of the American Society for Information Science. 1992;43:628–638. [Google Scholar]
  • 10.Vazquez A. Statistics of citation networks. 2001. E-prints arXiv:condmat/0105031.
  • 11.Lehmann S, Lautrup B, Jackson AD. Citation networks in high energy physics. Phys Rev E. 2003;68:026113. doi: 10.1103/PhysRevE.68.026113. [DOI] [PubMed] [Google Scholar]
  • 12.Bommarito MJ, Katz DM. A mathematical approach to the study of the united states code. Physica A. 2010;389:4195–4200. [Google Scholar]
  • 13.Perc M. Zipf's law and log-normal distributions in measures of scientific output across fields and institutions: 40 years of slovenia's research as an example. J Informetrics. 2010;4:358–364. [Google Scholar]
  • 14.Rodríguez-Navarro A. A simple index for the high-citation tail of citation distribution to quantify research performance in countries and institutions. PLoS ONE. 2011;6:e20510. doi: 10.1371/journal.pone.0020510. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 15.Stringer MJ, Sales-Pardo M, Amaral LAN. Effectiveness of Journal Ranking Schemes as a Tool for Locating Information. PLoS ONE. 2008;3:e1683. doi: 10.1371/journal.pone.0001683. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 16.Radicchi F, Fortunato S, Castellano C. Universality of citation distributions: towards an objective measure of scientific impact. Proc Natl Acad Sci USA. 2008;105:17268–17272. doi: 10.1073/pnas.0806977105. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 17.Wallace ML, Larivire V, Gingras Y. Modeling a century of citation distributions. J Informetrics. 2009;3:296–303. [Google Scholar]
  • 18.Anastasiadis AD, de Albuquerque MP, de Albuquerque MP, Mussi DB. Tsallis q-exponential describes the distribution of scientific citations - a new characterization of the impact. Scientometrics. 2010;83:205–218. [Google Scholar]
  • 19.Van Raan AFJ. Two-step competition process leads to quasi powerlawincome distributions - Application to scientific publication and citation distributions. Physica A. 2001;298:530–536. [Google Scholar]
  • 20.Van Raan AFJ. Competition amongst scientists for publication status: toward a model of scientific publication and citation distributions. Scientometrics. 2001;51:347–357. [Google Scholar]
  • 21.Kryssanov VV, Kuleshov EL, Rinaldo FJ, Ogawa H. We cite as we communicate: A communication model for the citation process. E-prints arXiv:cs/ 2007;0703115 [Google Scholar]
  • 22.Barabási AL, Albert R. Emergence of scaling in random networks. Science. 1999;286:509–512. doi: 10.1126/science.286.5439.509. [DOI] [PubMed] [Google Scholar]
  • 23.Clauset A, Shalizi CR, Newman MEJ. Power-law distributions in empirical data. SIAM Reviews. 2009;51:661–703. [Google Scholar]
  • 24.Barabási AL. The origin of bursts and heavy tails in human dynamics. Nature. 2005;435:207–211. doi: 10.1038/nature03459. [DOI] [PubMed] [Google Scholar]
  • 25.Vázquez A. Exact results for the barabási model of human dynamics. Phys Rev Lett. 2005;95:248701. doi: 10.1103/PhysRevLett.95.248701. [DOI] [PubMed] [Google Scholar]
  • 26.Vázquez A, Oliveira JG, Dezsö Z, Goh KI, Kondor I, et al. Modeling bursts and heavy tails in human dynamics. Phys Rev E. 2006;73:036127. doi: 10.1103/PhysRevE.73.036127. [DOI] [PubMed] [Google Scholar]
  • 27.Ratkiewicz J, Fortunato S, Flammini A, Menczer F, Vespignani A. Characterizing and modeling the dynamics of online popularity. Phys Rev Lett. 2010;105:158701. doi: 10.1103/PhysRevLett.105.158701. [DOI] [PubMed] [Google Scholar]
  • 28.Yule GU. A mathematical theory of evolution, based on the conclusions of dr. j. c. willis, f.r.s. Phil Trans R Soc London Series B. 1925;213:21–87. [Google Scholar]
  • 29.Simon HA. Wiley; 1957. Models of man: social and rational: mathematical essays on rational human behavior in a social setting. [Google Scholar]
  • 30.Price DD. A general theory of bibliometric and other cumulative advantage processes. J Am Soc Inform Sci. 1976;27:292–306. [Google Scholar]
  • 31.Krapivsky PL, Redner S, Leyvraz F. Connectivity of growing random networks. Phys Rev Lett. 2000;85:4629–4632. doi: 10.1103/PhysRevLett.85.4629. [DOI] [PubMed] [Google Scholar]
  • 32.Dorogovtsev SN, Mendes JFF, Samukhin AN. Structure of growing networks with preferential linking. Phys Rev Lett. 2000;85:4633–4636. doi: 10.1103/PhysRevLett.85.4633. [DOI] [PubMed] [Google Scholar]
  • 33.Wang M, Yu G, Yu D. Measuring the preferential attachment mechanism in citation networks. Physica A. 2008;387:4692–4698. [Google Scholar]
  • 34.Jeong H, Néda Z, Barabási AL. Measuring preferential attachment in evolving networks. Europhys Lett. 2003;61:567. [Google Scholar]
  • 35.Eom YH, Jeon C, Jeong H, Kahng B. Evolution of weighted scale-free networks in empirical data. Phys Rev E. 2008;77:056105. doi: 10.1103/PhysRevE.77.056105. [DOI] [PubMed] [Google Scholar]
  • 36.Hajra KB, Sen P. Phase transitions in an aging network. Phys Rev E. 2004;70:056103. doi: 10.1103/PhysRevE.70.056103. [DOI] [PubMed] [Google Scholar]
  • 37.Hajra KB, Sen P. Aging in citation networks. Physica A. 2005;346:44–48. [Google Scholar]
  • 38.Dorogovtsev SN, Mendes JFF. Evolution of networks with aging of sites. Phys Rev E. 2000;62:1842–1845. doi: 10.1103/physreve.62.1842. [DOI] [PubMed] [Google Scholar]
  • 39.Dorogovtsev SN, Mendes JFF. Scaling properties of scale-free evolving networks: Continuous approach. Phys Rev E. 2001;63:056125. doi: 10.1103/PhysRevE.63.056125. [DOI] [PubMed] [Google Scholar]
  • 40.Zhu H, Wang X, Zhu JY. Effect of aging on network structure. Phys Rev E. 2003;68:056121. doi: 10.1103/PhysRevE.68.056121. [DOI] [PubMed] [Google Scholar]

Articles from PLoS ONE are provided here courtesy of PLOS

RESOURCES