Search

Your search keyword '"Paz Sánchez, Juan"' showing total 5 results
Start Over Author "Paz Sánchez, Juan"
5 results on '"Paz Sánchez, Juan"'

1. Reconstruction of Networks from Their Betweenness Centrality

Author

Comellas, Francesc, Paz-Sánchez, Juan, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Giacobini, Mario, editor, Brabazon, Anthony, editor, Cagnoni, Stefano, editor, Di Caro, Gianni A., editor, Drechsler, Rolf, editor, Ekárt, Anikó, editor, Esparcia-Alcázar, Anna Isabel, editor, Farooq, Muddassar, editor, Fink, Andreas, editor, McCormack, Jon, editor, O’Neill, Michael, editor, Romero, Juan, editor, Rothlauf, Franz, editor, Squillero, Giovanni, editor, Uyar, A. Şima, editor, and Yang, Shengxiang, editor

Published
2008
Full Text
View/download PDF

2. Reconstruction of networks from their betweenness centrality

Author

Comellas Padró, Francesc de Paula, Paz-Sánchez, Juan, Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV, and Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Subjects
Combinacions (Matemàtica), 05 Combinatorics [Classificació AMS], Combinatorics, Betweennes centrality, Complex networks
Abstract

In this paper we study the reconstruction of a network topology from the values of its betweenness centrality, a measure of the influence of each of its nodes in the dissemination of information over the network. We consider a simple metaheuristic, simulated annealing, as the combinatorial optimization method to generate the network from the values of the betweenness centrality. We compare the performance of this technique when reconstructing different categories of networks –random, regular, small-world, scale-free and clustered–. We show that the method allows an exact reconstruction of small networks and leads to good topological approximations in the case of networks with larger orders. The method can be used to generate a quasi-optimal topology fora communication network from a list with the values of the maximum allowable traffic for each node.

Published
2008

3. Reconstrucció de grafs a partir del grau d'intermediació (betweenness) dels seus vèrtex

Author

Paz Sánchez, Juan, Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II, Comellas Padró, Francesc de Paula, and Maureso Sánchez, Montserrat

Subjects
Graph theory, Combinatorial optimization, Grafs, Teoria de, Mathematics -- Formulae, Matemàtica -- Fòrmules, Optimització combinatòria, Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs [Àrees temàtiques de la UPC]
Published
2007

4. Reconstruction of networks from their betweenness centrality

Author

Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV, Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions, Comellas Padró, Francesc de Paula, Paz-Sánchez, Juan, Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV, Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions, Comellas Padró, Francesc de Paula, and Paz-Sánchez, Juan

Abstract

In this paper we study the reconstruction of a network topology from the values of its betweenness centrality, a measure of the influence of each of its nodes in the dissemination of information over the network. We consider a simple metaheuristic, simulated annealing, as the combinatorial optimization method to generate the network from the values of the betweenness centrality. We compare the performance of this technique when reconstructing different categories of networks –random, regular, small-world, scale-free and clustered–. We show that the method allows an exact reconstruction of small networks and leads to good topological approximations in the case of networks with larger orders. The method can be used to generate a quasi-optimal topology fora communication network from a list with the values of the maximum allowable traffic for each node.

Published
2008

Catalog

Books, media, physical & digital resources
See catalog results