Abstract
In this paper we present a graph-based optimization method for information diffusion and attack durability in networks using properties of Complex Networks. We show why and how Complex Networks with Scale Free and Small World features can help optimize the topology of networks or indicate weak or strong elements of the network. We define some efficiency measures of information diffusion and attack durability in networks. Using these measures we formulate multicriteria optimization problem to choose the best network. We show a practical example of using the method based on an analysis of a few social networks.
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
Antkiewicz, R., Kasprzyk, R., Najgebauer, A., Tarapata, Z.: The concept of C4IS topology optimization using complex networks. In: Proceedings of the Military Communications and Information Systems Conference MCC 2009, Prague, Czech Republic, September 29-30 (2009), ISBN 978-80-7231-678-6
Barabasi, A.L., Reka, A.: Emergency of Scaling in Random Networks. Science 286, 509–512 (1999)
Barabasi, A.L., Reka, A.: Statistical mechanics of complex networks. Review of Modern Physics 74, 47–97 (2002)
Bhandari, R.: Survivable networks. Algorithms for divers routing. Kluver Academic Publishers, Dordrecht (1999)
Bonacich, P.: Factoring and Weighting Approaches to Status Scores and Clique Identification. Journal of Mathematical Sociology 2, 113–120 (1972)
Brandes, U.: A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25, 163–177 (2001)
Crucitti, P., Latora, V., Marchiori, M., Rapisarda, A.: Error and attack tolerance of complex networks. Physica A 340, 388–394 (2004)
Freeman, L.: A set of Measures of Centrality Based on Betweenness. Sociometry 40, 35–41 (1977)
Harary, F., Hage, P.: Eccentricity and centrality in networks. Social Networks 17, 57–63 (1995)
Krebs, V.: Mapping Networks of Terrorist Cells. Connections 24(3), 43–52 (2002)
Newman, M.E.: Models of the small world: A review. J. Stat. Phys. 101, 819–841 (2000)
Newman, M.E.: The structure and function of complex networks. SIMA Review 45(2), 167–256 (2003)
Penzar, D., Srbljinović, A.: About Modeling of Complex Networks With Applications To Terrorist Group Modelling. Interdisciplinary Description of Complex Systems 3(1), 27–43 (2005)
Sabidussi, G.: The Centrality Index of a Graph. Psychometrica 31, 581–603 (1966)
Strogatz, S.H.: Exploring complex networks. Nature 410, 268–276 (2001)
Tarapata, Z., Kasprzyk, R.: An application of multicriteria weighted graph similarity method to social networks analyzing. In: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (ASONAM 2009), Athens, Greece, July 20-22, pp. 366–368. IEEE Computer Society, Los Alamitos (2009)
Wang, X., Chen, G.: Complex Networks: Small-world, scale-free and beyond. IEEE Circuits and Systems Magazine 3(1), 6–20 (2003)
Watts, D.J., Strogatz, S.H.: Collective dynamics of “small-world” networks. Nature 393, 440–442 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tarapata, Z., Kasprzyk, R. (2010). Graph-Based Optimization Method for Information Diffusion and Attack Durability in Networks. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds) Rough Sets and Current Trends in Computing. RSCTC 2010. Lecture Notes in Computer Science(), vol 6086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13529-3_74
Download citation
DOI: https://doi.org/10.1007/978-3-642-13529-3_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13528-6
Online ISBN: 978-3-642-13529-3
eBook Packages: Computer ScienceComputer Science (R0)