Optimal communication schemes in a complex network: From trees to bottleneck networks
Departamento de Matemática Aplicada, Universidad Rey Juan Carlos, 28933 Mostoles, Madrid, Spain
The robustness of a communication scheme in a complex network may depend on the location of distinguished nodes. We collect different approaches to the idea of vulnerability and we give methods that help us to decide the good spots for the leader nodes. More specifically, we present a constructive method that yields the best location in a communication scheme for a leader node in the case that the underlying network is tree-shaped and show how it can be used for more general networks. In order to do that we consider a local approach via the bottleneck tree associated to a given node, as well as a uniform a approach by means of the so-called bottleneck network for several communication topologies.
© EDP Sciences, Springer-Verlag, 2007