Pedroche, F.Criado, R.Garcia, E.Romance, M.2011-11-142011-11-142011-10-24Int.J.Comp.Syst.Sci. vol.1(2), pp.124-128 (2011)2174-6036http://hdl.handle.net/10115/5745A general growth model of random networks based on centrality measures is introduced. This formalism extends the well-known models of prefer- ential attachment. We propose to set the preferential attachment using a linear function of some centrality measures ranging from local to global scale. The aim is to include spectral measures, such as PageRank and Bonacich, and geodesic measures, such as betweenness and closeness. In this paper we present a first analysis using degree and Personalized PageRank.engAtribución-NoComercial-SinDerivadas 3.0 Españahttp://creativecommons.org/licenses/by-nc-nd/3.0/es/Growing networksPageRankIn-Degreeinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess3304 Tecnología de Los Ordenadores12 Matemáticas