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.
Research supported by the Ministerio de Educación y Ciencia, Spain, and the European Regional Development Fund under project TEC2005-03575 and by the Catalan Research Council under project 2005SGR00256.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barabasi, A.-L., Bonabeau, E.: Scale-free networks. Scientific American 288(5), 50–59 (2003)
Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167–256 (2003)
Ipsen, M., Mikhailov, A.S.: Evolutionary reconstruction of networks. Phys. Rev. E. 66, 46109 (2002)
Freeman, L.C.: A set of measures of centrality based upon betweenness. Sociometry 40, 35–41 (1977)
Goh, K.-I., Oh, E., Jeong, H., Kahng, B., Kim, D.: Classification of scale-free networks. Proc. Natl. Acad. Sci. USA 99, 12583–12588 (2002)
Comellas, F., Gago, S.: Synchronizability of complex networks. J. Phys. A: Math. Theor. 40, 4483–4492 (2007)
Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. John Wiley & Sons Ltd, New York (1997)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Schmidt, D.C., Druffel, L.E.: A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices. Journal of the ACM 23, 433–445 (1976)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)
Paz-Sanchez, J.: Reconstrucció de grafs a partir del grau d’intermediació (betweenness) dels seus vèrtexs. PFC (Master Thesis) (in Catalan) (July 2007)
Dorigo, M., Stützle, T.: Ant colony optimization. MIT Press, Cambridge (2004)
Comellas, F., Sapena, E.: A multiagent algorithm for graph partitioning. In: Rothlauf, F., Branke, J., Cagnoni, S., Costa, E., Cotta, C., Drechsler, R., Lutton, E., Machado, P., Moore, J.H., Romero, J., Smith, G.D., Squillero, G., Takagi, H. (eds.) EvoWorkshops 2006. LNCS, vol. 3907, pp. 279–285. Springer, Heidelberg (2006)
Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. & Ops. Res. 13, 533–549 (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Comellas, F., Paz-Sánchez, J. (2008). Reconstruction of Networks from Their Betweenness Centrality. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2008. Lecture Notes in Computer Science, vol 4974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78761-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-78761-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78760-0
Online ISBN: 978-3-540-78761-7
eBook Packages: Computer ScienceComputer Science (R0)