Matrix growth models based on centrality measures: a first analysis
dc.contributor.author | Pedroche, F. | |
dc.contributor.author | Criado, R. | |
dc.contributor.author | Garcia, E. | |
dc.contributor.author | Romance, M. | |
dc.date.accessioned | 2011-11-14T09:11:59Z | |
dc.date.available | 2011-11-14T09:11:59Z | |
dc.date.issued | 2011-10-24 | |
dc.identifier.citation | Int.J.Comp.Syst.Sci. vol.1(2), pp.124-128 (2011) | es |
dc.identifier.issn | 2174-6036 | |
dc.identifier.uri | http://hdl.handle.net/10115/5745 | |
dc.description.abstract | A 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. | es |
dc.language.iso | eng | es |
dc.publisher | Yamir Moreno. Universidad Rey Juan Carlos/ Regino Criado. Universidad Rey Juan Carlos | es |
dc.rights | Atribución-NoComercial-SinDerivadas 3.0 España | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
dc.subject | Growing networks | es |
dc.subject | PageRank | es |
dc.subject | In-Degree | es |
dc.title | Matrix growth models based on centrality measures: a first analysis | es |
dc.type | info:eu-repo/semantics/article | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.subject.unesco | 3304 Tecnología de Los Ordenadores | es |
dc.subject.unesco | 12 Matemáticas | es |
dc.description.departamento | Matemática Aplicada |
Files in this item
This item appears in the following Collection(s)
-
Artículos de Revista [3516]
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 España