Skip to main content
Article thumbnail
Location of Repository

Reconstruction of Networks from their

By Betweenness Centrality, Francesc Comellas and Juan Paz-sánchez

Abstract

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 for a communication network from a list with the values of the maximum allowable traffic for each node.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.2042
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • https://upcommons.upc.edu/e-pr... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.