Abstract
Graph models are often constructed as a tool to better understand the growth dynamics of complex networks. Traditionally, graph models have been constructed through a very time consuming and difficult manual process. Recently, there have been various methods proposed to alleviate the manual efforts required when constructing these models, using statistical and evolutionary strategies. A major difficulty associated with automated approaches lies in the evaluation of candidate models. To address this difficulty, this paper examines a number of well-known network properties using a proposed meta-analysis procedure. The meta-analysis demonstrated how these network measures interacted when used together as classifiers to determine network, and thus model, (dis)similarity. The analytical results formed the basis of a fitness evaluation scheme used in a genetic programming (GP) system to automatically construct graph models for complex networks. The GP-based automatic inference system was used to reproduce two well-known graph models, the results of which indicated that the evolved models exemplified striking similarity when compared to their respective targets on a number of structural network properties.
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
Notes
- 1.
Transitivity is also commonly referred to as the clustering coefficient.
References
Arianos, S., Bompard, E., Carbone, A., Xue, F.: Power grid vulnerability: a complex network approach. Chaos: an Interdisciplinary. J. Nonlinear Sci. 19(1), 013119 (2009)
Bailey, A., Ventresca, M., Ombuki-Berman, B.: Genetic programming for the automatic inference of graph models for complex networks. IEEE Trans. Evol. Comput. 18(3), 405–419 (2014)
Bailey, A., Ventresca, M., Ombuki-Berman, B.: Automatic generation of graph models for complex networks by genetic programming. In: Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation Conference, GECCO 2012, pp. 711–718. ACM, New York, NY, USA (2012)
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Berg, J., Lässig, M., Wagner, A.: Structure and evolution of protein interaction networks: a statistical model for link dynamics and gene duplications. BMC Evol. Biol. 4(1), 51 (2004)
Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92, 1170–1182 (1987)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1), 107–117 (1998)
Chung, F., Lu, L.: The average distance in a random graph with given expected degrees. Internet Math. 1(1), 91–113 (2004)
Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks with aging of sites. Phys. Rev. E 62(2), 1842 (2000)
Erdös, P., Rényi, A.: On random graphs. Publicationes Mathematicae 6, 290–297 (1959)
Fan, Z., Chen, G., Zhang, Y.: Using topological characteristics to evaluate complex network models can be misleading. arXiv preprint arXiv:1011.0126 (2010)
Fisher, R.: Statistical Methods for Research Workers. Oliver and Boyd, Edinburgh (1925)
Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)
Freeman, L.C.: Centrality in social networks: conceptual clarification. Soc. Netw. 1(3), 215–239 (1979)
Goldenberg, A., Zheng, A.X., Fienberg, S.E., Airoldi, E.M.: A survey of statistical network models. Found. Trends Mach. Learn. 2(2), 129–233 (2010)
Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: an approach to modeling networks. J. Mach. Learn. Res. 11, 985–1042 (2010)
Leskovec, J., Faloutsos, C.: Scalable modeling of real graphs using Kronecker multiplication. In: Proceedings of the 24th International Conference on Machine Learning, pp. 497–504. ACM (2007)
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)
Massey Jr., F.J.: The kolmogorov-smirnov test for goodness of fit. J. Am. Stat. Assoc. 46(253), 68–78 (1951)
Medland, M.R., Harrison, K.R., Ombuki-Berman, B.: Demonstrating the power of object-oriented genetic programming via the inference of graph models for complex networks. In: 2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC), NaBIC 2014, pp. 305–311. IEEE (2014)
Medland, M.R., Harrison, K.R., Ombuki-Berman, B.: Incorporating expert knowledge in object-oriented genetic programming. In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation Companion, GECCO Comp 2014, pp. 145–146. ACM, New York, NY, USA (2014)
Menezes, T., Roth, C.: Symbolic regression of generative network models. Scientific reports 4 (2014)
Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)
Stam, C.J., Reijneveld, J.C.: Graph theoretical analysis of complex networks in the brain. Nonlinear Biomed. Phys. 1(1), 3 (2007)
Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440–442 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Harrison, K.R., Ventresca, M., Ombuki-Berman, B.M. (2015). Investigating Fitness Measures for the Automatic Construction of Graph Models. In: Mora, A., Squillero, G. (eds) Applications of Evolutionary Computation. EvoApplications 2015. Lecture Notes in Computer Science(), vol 9028. Springer, Cham. https://doi.org/10.1007/978-3-319-16549-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-16549-3_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16548-6
Online ISBN: 978-3-319-16549-3
eBook Packages: Computer ScienceComputer Science (R0)