Fitness-Based Generative Models for Power-Law Networks
Many real-world complex networks exhibit a power-law degree distribution. A dominant concept traditionally believed to underlie the emergence of this phenomenon is the mechanism of preferential attachment which originally states that in a growing network a node with higher degree is more likely to be connected by joining nodes. However, a line of research towards a naturally comprehensible explanation for the formation of power-law networks has argued that degree is not the only key factor influencing the network growth. Instead, it is conjectured that each node has a “fitness” representing its propensity to attract links. The concept of fitness is more general than degree; the former may be some factor that is not degree, or may be degree in combination with other factors. This chapter presents a discussion of existing models for generating power-law networks, that belong to this approach.
The authors would like to thank UMass Boston colleagues, Shilpa Ghadge, Bala Sundaram, and Timothy Killingback, for valuable discussions regarding the lognormal fitness model presented in this chapter.
- 1.Albert, R., Jeong, H., Barabási, A.L.: Diameter of the world-wide-web. Nature 400, 107–110 (1999)Google Scholar
- 2.Barabási, A.: The physics of the web. Physics World 14-7, 33–38 (2001)Google Scholar
- 4.Bedogne, C., Rodgers, G.J.: Complex growing networks with intrinsic vertex fitness. Phys. Rev. E 74, 046,115 (2006)Google Scholar
- 6.Caldarelli, G., Capocci, A., Rios, P.D.L., Munoz, M.: Scale-free networks from varying vertex intrinsic fitness. Phys. Rev. Lett. 89-25, 258,702 (2002)Google Scholar
- 7.Callaway, D.S., Hopcroft, J.E., Kleinberg, J.M., Newman, M.E.J., Strogatz, S.H.: Are randomly grown graphs really random? Physical Review E 64, 041,902 (2001). URL http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0104546 Google Scholar
- 9.Erdós, P., Rényi, A.: On random graphs. Publicationes Mathematicae 6, 290–297 (1959)Google Scholar
- 10.Erdós, P., Rényi, A.: On the evolution of random graphs. Publ. of Math. Inst. of the Hungarian Acad. of Sci. 5, 17–61 (1960)Google Scholar
- 12.Faloutros, M., P. Faloutros, Faloutros, C.: On power-law relationship of the internet topology. ACM SIGCOM 99, Comp. Comm. Rev. 29, 251–260 (1999)Google Scholar
- 15.Jeong, H., Tombor, B., Albert, R., Oltvai, N., Barabási, A.: The large-scale organization of metabolic networks. Nature 607, 651 (2000)Google Scholar
- 17.Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: FOCS ’00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p. 57. IEEE Computer Society, Washington, DC, USA (2000)Google Scholar
- 18.Li, L., Alderson, D., Doyle, J., Willinger, W.: Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications. In Proceedings of Internet Mathematics (2005)Google Scholar
- 20.Moore, C., Ghoshal, G., Newman, M.E.J.: Exact solutions for models of evolving networks with addition and deletion of nodes. Phys. Rev. E 74(3), 036,121 (2006). DOI 10.1103/PhysRevE.74.036121Google Scholar
- 22.Vito, D., Caldarelli, G., Butta, P.: Vertex intrinsic fitness: How to produce arbitrary scale-free networks. Phys. Rev. E 70, 056,126 (2004)Google Scholar