Distance-d covering problems in scale-free networks with degree correlations

Simple item page
dc.creatorEchenique, Pablo
dc.creatorGomez-Gardenes, Jesus
dc.creatorMoreno, Yamir
dc.creatorVazquez, Alexei
dc.date2004-06-23
dc.date2005-01-31
dc.date.accessioned2026-07-07T06:22:21Z
dc.date.available2026-07-07T06:22:21Z
dc.descriptionA 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 an heuristic method that allows to find near-optimal solutions to the covering problem in real communication networks. The results show that the optimal allocation of resources strongly depends on the topology of the underlying networks. Whether a centralized or distributed design is to be used relies upon the degree correlations between connected vertices.
dc.descriptionAPS format. Version to appear in Physical Review E (Rapid Communication)
dc.identifierhttps://arxiv.org/abs/cond-mat/0406547
dc.identifierhttp://arxiv.org/abs/cond-mat/0406547
dc.identifierPhysical Review E, 71, 035102(R) (2005)
dc.identifierdoi:10.1103/PhysRevE.71.035102
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/95883
dc.subjectStatistical Mechanics
dc.titleDistance-d covering problems in scale-free networks with degree correlations
dc.typetext

Files

Collections

arXiv