Skip to main content
Log in

Abstract

In this paper, we explore the consequences of a distinction between ‘live' and ‘dead' network nodes; ‘live' nodes are able to acquire new links whereas ‘dead' nodes are static. We develop an analytically soluble growing network model incorporating this distinction and show that it can provide a quantitative description of the empirical network composed of citations and references (in- and out-links) between papers (nodes) in the SPIRES database of scientific papers in high energy physics. We also demonstrate that the death mechanism alone can result in power law degree distributions for the resulting network.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Albert, R. and A.-L. Barabási (2002), “Statistical Mechanics of Complex Networks,” Reviews of Modern Physics, 74, 47.

    Article  Google Scholar 

  • Barabási, A.-L. and R. Albert (1999), “Emergence of Scaling in Random Networks,” Science, 286, 509.

    Article  PubMed  Google Scholar 

  • de Solla Price, D. (1965), “Networks of Scientific Papers,” Science, 149, 510–515.

  • de Solla Price, D. (1976), “A General Theory of Bibliometric and Other Cumulative Advantage Processes,” Journal of the American Society for Information Science, 27, 292.

    Google Scholar 

  • Dorogovtsev, S.N. and J.F.F. Mendes (2002), “Evolution of Networks,” Advances in Physics, 51, 1079.

    Article  Google Scholar 

  • Klemm, K. and V.M. Eguíluz (2002), “Highly Clustered Scale-Free Networks,” Physical Review E, 65, 036123.

    Article  Google Scholar 

  • Krapivsky, P.L. and S. Redner (2001), “Organization of Growing Random Networks,” Physical Review E, 63, 066123.

    Article  Google Scholar 

  • Krapivsky, P.L., S. Redner, and F. Leyvraz (2000), “Connectivity of Growing Random Networks,” Physical Review Letters, 85(21), 4629.

    Article  PubMed  Google Scholar 

  • Lehmann, S., B.E. Lautrup, and A.D. Jackson (2003), “Citation Networks in High Energy Physics,” Physical Review E, 68.

  • Lehmann, S., A.D. Jackson, and B.E. Lautrup (2005), “Life, Death, and Preferential Attachment,” Europhysics Letters, 69, 298.

    Article  Google Scholar 

  • Newman, M.E.J. (2003), “The Structure and Function of Complex Networks,” SIAM Review, 45, 167.

    Article  Google Scholar 

  • Redner, S. (1998). “How Popular is Your Paper? An Emperical Study of the Citation Distribution,” European Physics Journal B, 4, 131–134.

    Google Scholar 

  • Redner, S. (2004), “Citation Statistics From More Than a Century of Physical Review,” Physics/0407137.

  • Simon, H.A. (1957), Models of Man. Wiley, New York.

    Google Scholar 

  • Watts, D.J. (1999), Small Worlds. Princeton University Press, Princeton.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Lehmann.

Additional information

Sune Lehmann is pursuing his Ph.D. at the Technical University of Denmark. In 2003 he received his M.Sc. degree from the Niels Bohr Institute in Copenhagen, Denmark. Currently, his research are primarily the physics of complex systems, in particular complex networks in sociology and biophysics.

Andrew D. Jackson is professor of theoretical physics at the Niels Bohr Institute, Copenhagen, Denmark. His primary research activities are related to non-perturbative quantum field theories and the theory of strongly interacting quantum fluids including Bose-Einstein condensates. His work on complex systems, particularly that related to random matrix theory, is motivated by these primary interests. Jackson has an active interest in the history of science and has published books and articles on Hans Christian Orsted. He is a Fellow of the American Physical Society and a member of the Royal Danish Academy of Sciences and Letters.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lehmann, S., Jackson, A.D. Live and Dead Nodes. Comput Math Organiz Theor 11, 161–170 (2005). https://doi.org/10.1007/s10588-005-3942-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10588-005-3942-1

Keywords

Navigation