Skip to main content
Log in

Modeling idiosyncratic properties of collaboration networks revisited

  • Published:
Scientometrics Aims and scope Submit manuscript

Abstract

A study on the network characteristics of two collaboration networks constructed from the ACM and DBLP digital libraries is presented. Different types of generic network models and several examples are reviewed and experimented on re-generating the collaboration networks. The results reveal that while these models can generate the power-law degree distribution sufficiently well, they are not able to capture the other two important dynamic metrics: average distance and clustering coefficient. While all current models result in small average distances, none shows the same tendency as the real networks do. Furthermore all models seem blind to generating large clustering coefficients. To remedy these shortcomings, we propose a new model with promising results. We get closer values for the dynamic measures while having the degree distribution still power-law by having link addition probabilities change over time, and link attachment happen within local neighborhood only or globally, as seen in the two collaboration networks.

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.

Similar content being viewed by others

References

  • Albert, R., Barabasi, A.-L. (2000), Topology of evolving network: local events and universality. Physical Review Letters, 85(24): 5234–5237.

    Article  Google Scholar 

  • Albert, R., Barabasi, A.-L. (2002), Statistical mechanics of complex networks. Rev. of Mod. Phys., 74: 47.

    Article  MathSciNet  Google Scholar 

  • Amaral, L., Scala, A., Barthelemy, M., Stanley, H. (2000), Classes of small-world networks. Proc. Natl. Acad. Sci., USA, 97: 11149.

    Article  Google Scholar 

  • Atkins, H., Lyons, C., Ratner, H., Risher, C., Shillum, C., Sidman, D., Stevens, A., Arms W. (2000), Reference linking with DOIs: A case study. D-Lib Magazine.

  • Barabasi, A. L., Jeong, H., Neda, Z., Ravasz, E., Schubert, A., Vicsek, T. (2002), Evolution of the social network of scientific collaborations. Physica A, 311: 590–614.

    Article  MATH  MathSciNet  Google Scholar 

  • Barabasi, A.-L., Albert, R. (1999), Emergence of scaling in random networks. Science, 286: 509–512.

    Article  MathSciNet  Google Scholar 

  • Bianconi, G., Barabasi, A.-L. (2001), Competition and multiscaling in evolving networks. Europhys. Lett., 54: 436.

    Article  Google Scholar 

  • Bu, T., Towsley, D. (2002), On distinguishing between Internet power law topology generators. INFOCOM. DBLP, Computer Science Bibliography. http://www.informatik.uni-trier.de/~ley.

  • Dorogovtsev, S. N., Mendes, J. F. F. (2000), Evolution of networks with aging of sites, Phys. Rev. E., 62(2): 1842–1845.

    Article  Google Scholar 

  • Dorogovtsev, S. N., Mendes, J. F. F. (2002), Evolution of networks. Advances in Physics, 1079–1187.

  • Elmacioglu, E., Lee, D. (2005), On six degrees of separation on DBLP-DB and more. ACM SIGMOD Record, 34(2): 33–40.

    Article  Google Scholar 

  • Erdős, P., Rényi, A. (1959), On random graphs. Publ. Math., Debrecen, 6: 290–297.

    MathSciNet  Google Scholar 

  • Fronczak, A., Holyst J. A., Jedynak, M, Sienkiewicz J. (2002), Higher order clustering coefficients in Barabasi-Albert networks. Physica A, 316(1–4): 688–690.

    Article  MATH  MathSciNet  Google Scholar 

  • Holme, P., Kim, B. J. (2002) Growing scale-free networks with tunable clustering. Phys. Rev. E, 65: 026107.

    Google Scholar 

  • Hong, Y., On, B.-W., Lee, D. (2004), System Support for Name Authority Control Problem in Digital Libraries: OpenDBLP Approach. ECDL, Bath, UK.

    Google Scholar 

  • Milgram, S. (1967) The small world problem. Psychology Today, 2: 60–70.

    Google Scholar 

  • Newman, M. E. J. (2001), Who is the best connected scientist? A study of scientific coauthorship networks. Phys. Rev. E, 64: 016131; Phys. Rev. E, 64: 016132.

    Google Scholar 

  • Newman, M. E. J. (2003), The structure and function of complex networks. SIAM Review, 45: 167–256.

    Article  MATH  MathSciNet  Google Scholar 

  • Newman, M. E. J. (2005), Power laws, Pareto distributions and Zipf’s law. Contemporary Physics, 46: 323–351.

    Article  Google Scholar 

  • Park, S.-T., Pennock, D. M., Giles C. L. (2004), Comparing static and dynamic measurements and models of the Internet’s AS topology. INFOCOM.

  • 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. PNAS, 99(8): 5207–5211.

    Article  MATH  Google Scholar 

  • Ravasz, E., Barabasi, A.-L. (2003), Hierarchical organization in complex networks. Phys. Rev. E, 67: 026112.

    Article  Google Scholar 

  • Watts, D. J. (1999), Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press, Princeton.

    Google Scholar 

  • Watts, D. J., Strogatz, S. H. (1998), Collective dynamics of ’small-world’ networks. Nature, 393: 440.

    Article  Google Scholar 

  • Waxman, B. M. (1988), Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications, 6(9): 1617–1622.

    Article  Google Scholar 

  • Yook, S. H., Jeong, H., Barabasi, A.-L. (2002), Modeling the Internet’s large-scale topology. Proceedings of the National Academy of Sciences (PNAS), 99 13382–13386.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ergin Elmacioglu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elmacioglu, E., Lee, D. Modeling idiosyncratic properties of collaboration networks revisited. Scientometrics 80, 195–216 (2009). https://doi.org/10.1007/s11192-007-2047-7

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11192-007-2047-7

Keywords

Navigation