Distance-d covering problems in scale-free networks with degree correlations
Pablo Echenique, Jesus Gomez-Gardenes, Yamir Moreno, Alexei Vazquez
Abstract
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 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.
Create a lesson
Related papers
Real-Space renormalization for the drawups and drawdowns of stochastic trajectories: universality classes for diffusion processes and random walks via the scale function
Cecile Monthus
Stochastic synthesis and degradation of arbitrary diffusive processes
Denis Boyer, Gabriel Mercado-Vásquez
Critical amplitudes of the Baxter-Wu model from MCPA and Wolff simulations: free-exponent and fixed-exponent fits
Vyacheslav Mozolenko, Ian Pile, Lev Shchur
Capillary Coarsening Drives Re-entrant Statistical Transitions in Early Coffee-Ring Growth
Arundas Chandradasan, Dileep Mampallil
Maximum entropy explanation for the ubiquity of power-law mechanical responses
Sverre Holm
Thermodynamic Bethe Ansatz for the Toda chain from inverse scattering transform
Alberto Brollo