Abstract
Complex systems are characterized by a level of nonlinear coupling among system components. A graph representation in general, and complex networks in specific, have been extensively used for understanding complex systems. In this chapter, we offer a gentle introduction to complex networks, a discussion of their properties and metrics to measure these properties, and algorithms for network generation that could be used to generate synthetic networks with real-world or theoretical properties. We then introduce a variety of evolutionary algorithms where each individual in a population inhibits a node in a complex network. This representation limits the other individuals that each individual is allowed to interact with. This localized interaction warrants a discussion on the selection pressure that each network topology implicitly imposes on its population.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barabási, A.L., Albert, R.: Emergence of scaling in random networks (1999)
Barabási, A.L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks (1999)
Blum, A., Chan, T.H., Rwebangira, M.R.: A random-surfer web-graph model. In: 2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 238–246. SIAM (2006)
Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6) (2004)
Erdős, P., Rényi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl 5, 17–61 (1960)
González, M.C., Lind, P.G., Herrmann, H.J.: System of mobile agents to model social networks. Phys. Rev. Lett. 96(8) (2006)
Hansen, T.F.: Is modularity necessary for evolvability? Remarks on the relationship between pleiotropy and evolvability. Biosystems 69(2), 83–94 (2003)
Humphries, M.D., Gurney, K.: Network small-world-ness: a quantitative method for determining canonical network equivalence. PloS one 3(4) (2008). (DOI e0002051)
Jacob, F., Monod, J.: Genetic regulatory mechanisms in the synthesis of proteins. J. Mol. Biol. 3(3), 318–356 (1961)
Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: Stochastic models for the web graph. In: Proceedings of 41st Annual Symposium on Foundations of Computer Science, 2000, pp. 57–65. IEEE (2000)
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 177–187. ACM (2005)
Newman, M.E.: Mixing patterns in networks. Phys. Rev. E 67(2) (2003)
Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2) (2004)
Newman, M.E., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64(2) (2001)
Pastor-Satorras, R., Vázquez, A., Vespignani, A.: Dynamical and correlation properties of the internet. Phys. Rev. Lett. 87(25) (2001). (DOI 258701)
Pennock, D.M., Flake, G.W., Lawrence, S., Glover, E.J., Giles, C.L.: Winners don’t take all: characterizing the competition for links on the web. Proc. Natl. Acad. Sci. 99(8), 5207–5211 (2002)
Pimm, S.L.: Food Webs, pp. 1–11 (1982)
Travers, J., Milgram, S.: The small world problem. Phychol. Today 1(1), 61–67 (1967)
Wagner, A.: Does evolutionary plasticity evolve? Evolution 50(3), 1008–1023 (1996)
Wagner, G.P., Altenberg, L.: Perspective: complex adaptations and the evolution of evolvability. Evolution 50(3), 967–976 (1996)
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, vol. 8 (1994)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440 (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Liu, J., Abbass, H.A., Tan, K.C. (2019). Complex Networks. In: Evolutionary Computation and Complex Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-60000-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-60000-0_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59998-4
Online ISBN: 978-3-319-60000-0
eBook Packages: EngineeringEngineering (R0)