Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/41147
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | Distance-d covering problems in scale-free networks with degree correlations |
Autor: | Echenique, Pablo CSIC ORCID; Gómez-Gardeñes, Jesús; Moreno, Yamir; Vázquez, Alexei | Palabras clave: | Covering Complex networks |
Fecha de publicación: | 21-mar-2005 | Editor: | American Physical Society | Citación: | Physical Review E 71 035102(R) (2005) | Resumen: | A number of problems in communication systems demand the distributed allocation of network resources in order to provide better services, sampling, and distribution methods. The solution to these issues is becoming more challenging due to the increasing size and complexity of communication networks. We report here on a heuristic method to find near-optimal solutions to the covering problem in real communication networks, demonstrating that whether a centralized or a distributed design is to be used relies upon the degree correlations between connected vertices. We also show that the general belief that by targeting the hubs one can efficiently solve most problems on networks with a power-law degree distribution is not valid for assortative networks. | Descripción: | This paper is copyright of the American Physical Society and the published version can be found at http://pre.aps.org/abstract/PRE/v71/i3/e035102 | Versión del editor: | http://pre.aps.org/abstract/PRE/v71/i3/e035102 | URI: | http://hdl.handle.net/10261/41147 | DOI: | 10.1103/PhysRevE.71.035102 |
Aparece en las colecciones: | (IQF) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
2005_Covering.pdf | 139,54 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
327
checked on 23-abr-2024
Download(s)
267
checked on 23-abr-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.