Skip to main content

Stochastic Modeling of References and Citations

  • Chapter
  • First Online:
Book cover Citation Analysis and Dynamics of Citation Networks

Part of the book series: SpringerBriefs in Complexity ((BRIEFSCOMPLEXITY))

  • 571 Accesses

Abstract

We discuss here how the authors compose reference lists of their papers. We assume that the author chooses his references basing on the copying/recursive search algorithm. We put this algorithm at the core of the quantitative model accounting for the age composition of the reference lists of papers. The model contains two empirical functions: the aging function and the obsolescence function, and one empirical parameter—paper’s fitness. At the next step, we calibrate this model in measurements with Physics papers, namely, we determine the aging function, obsolescence function, and paper’s fitness averaged over the groups of similar papers. At the next step, we extend our approach to individual papers and formulate a probabilistic model of their citation dynamics. This model represents citation dynamic of a paper as a self-exciting stochastic process (Hawkes process). We demonstrate that the mean-field approximation of this probabilistic model yields the age distribution of references, as expected.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bianconi, G., & Barabasi, A.-L. (2001). Bose-Einstein condensation in complex networks. Physical Review Letters, 86, 5632–5635.

    Article  ADS  Google Scholar 

  2. Caldarelli, G., Capocci, A., De Los Rios, P., & Muñoz, M. A. (2002). Scale-free networks from varying vertex intrinsic fitness. Physical Review Letters, 89(25), 258702.

    Article  ADS  Google Scholar 

  3. Candia, C., Jara-Figueroa, C., Rodriguez-Sickert, C., Barabási, A. L., & Hidalgo, C. A. (2019). The universal decay of collective memory and attention. Nature Human Behaviour, 3(1), 82–91.

    Article  Google Scholar 

  4. Clough, J. R., Gollings, J., Loach, T. V., & Evans, T. S. (2014). Transitive reduction of citation networks. Journal of Complex Networks, 3(2), 189–203.

    Article  MathSciNet  Google Scholar 

  5. Gleeson, J. P., Cellai, D., Onnela, J.-P., Porter, M. A., & Reed-Tsochas, F. (2014). A simple generative model of collective online behavior. Proceedings of the National Academy of Sciences, 111(29), 10411–10415.

    Article  ADS  Google Scholar 

  6. Goldberg, S. R., Anthony, H., & Evans, T. S. (2015). Modelling citation networks. Scientometrics, 105(3), 1577–1604.

    Article  Google Scholar 

  7. Golosovsky, M., & Solomon, S. (2012). Stochastic dynamical model of a growing citation network based on a self-exciting point process. Physical Review Letters, 109(9), 098701.

    Article  ADS  Google Scholar 

  8. Golosovsky, M., & Solomon, S. (2017). Growing complex network of citations of scientific papers: Modeling and measurements. Physical Review E, 95(1), 012324.

    Article  ADS  Google Scholar 

  9. Krapivsky, P. L., & Redner, S. (2005). Network growth by copying. Physical Review E, 71, 036118.

    Article  ADS  Google Scholar 

  10. Menczer, F. (2004). Evolution of document networks. Proceedings of the National Academy of Sciences, 101(Supplement 1), 5261–5265.

    Article  ADS  Google Scholar 

  11. Min, C., Ding, Y., Li, J., Bu, Y., Pei, L., & Sun, J. (2018). Innovation or imitation: The diffusion of citations. Journal of the Association for Information Science and Technology, 69(10), 1271–1282.

    Article  Google Scholar 

  12. Papadopoulos, F., Kitsak, M., Serrano, M. Á., Boguñá, M., & Krioukov, D. (2012). Popularity versus similarity in growing networks. Nature, 489(7417), 537–540.

    Article  ADS  Google Scholar 

  13. Pennock, D. M., Flake, G. W., Lawrence, S., Glover, E. J., & Giles, C. L. (2002). Winners don’t take all: Characterizing the competition for links on the web. Proceedings of the National Academy of Sciences, 99(8), 5207–5211.

    Article  ADS  Google Scholar 

  14. Peterson, G. J., Presse, S., & Dill, K. A. (2010). Nonuniversal power law scaling in the probability distribution of scientific citations. Proceedings of the National Academy of Sciences, 107(37), 16023–16027.

    Article  ADS  Google Scholar 

  15. Shao, Z. G., Zou, X. W., Tan, Z. J., & Jin, Z. Z. (2006). Growing networks with mixed attachment mechanisms. Journal of Physics A: Mathematical and General, 39(9), 2035–2042.

    Article  ADS  MathSciNet  Google Scholar 

  16. Simkin, M. V., & Roychowdhury, V. P. (2007). A mathematical theory of citing. Journal of the American Society for Information Science and Technology, 58(11), 1661–1673.

    Article  Google Scholar 

  17. Vazquez, A. (2001). Disordered networks generated by recursive searches. Europhysics Letters, 54(4), 430–435.

    Article  ADS  Google Scholar 

  18. Wang, M., Yu, G., & Yu, D. (2008). Measuring the preferential attachment mechanism in citation networks. Physica A: Statistical Mechanics and Its Applications, 387(18), 4692–4698.

    Article  ADS  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Golosovsky, M. (2019). Stochastic Modeling of References and Citations. In: Citation Analysis and Dynamics of Citation Networks. SpringerBriefs in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-030-28169-4_3

Download citation

Publish with us

Policies and ethics