Skip to main content
Top

2018 | OriginalPaper | Chapter

Community Detection in NK Landscapes - An Empirical Study of Complexity Transitions in Interactive Networks

Authors : Asep Maulana, André H. Deutz, Erik Schultes, Michael T. M. Emmerich

Published in: EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation VI

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

NK-landscapes have been used as models of gene interaction in biology, but also to understand the influence of interaction between variables on the controllability and optimality organizations as a whole. As such, instead of gene networks they could also be models of economical systems or social networks. In NK-landscapes a fitness function is computed as a sum of N trait values. Each trait depends on the variable directly associated with the trait and K other variables – so-called epistatic variables. With increasing number of interactions the ruggedness of the function increases (local optima). The transition in complexity resembles phase transitions, and for \(K \ge 2\) the problem to find global optima becomes NP hard. This is not the case if epistatic variables are local, meaning that all interactions are local.
In this research we study NK-landscapes from the perspective of communities and community detection. We will not look at communities of epistatic links but instead focus on links due to correlation between phenotypic traits. To this end we view a single trait as an individual agent which strives to maximize its contributed value to the net value of a community. If the value of a single trait is high whenever that of another trait is low we regard these traits as being conflicting. If high values of one trait coincide with high values of other traits we regard the traits as supporting each other. Finally, if the value of two traits is uncorrelated, we view their relationship as being neutral. We study what happens to the system of traits when the NK-landscape undergoes a critical transition to a more complex model via the increment of k. In particular, we study the effect of locality of interaction on the shape and number of the emerging communities of traits and show that the number of communities reaches its lowest point for medium values of k and not, as might be expected, for a fully connected epistatic matrix (case \(k=N-1\)).

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
1
Named after the university of Louvain-de-Neuve in Belgium where this method was originated.
 
Literature
1.
2.
go back to reference Altenberg, L.: Nk landscapes. In: Michalewicz, Z., Bäck, T., Fogel, D. (eds.) Handbook of Evolutionary Computation. Oxford University Press (1997) Altenberg, L.: Nk landscapes. In: Michalewicz, Z., Bäck, T., Fogel, D. (eds.) Handbook of Evolutionary Computation. Oxford University Press (1997)
3.
go back to reference Anderson, P.: Perspective: complexity theory and organization science. Organ. Sci. 10(3), 216–232 (1999)CrossRef Anderson, P.: Perspective: complexity theory and organization science. Organ. Sci. 10(3), 216–232 (1999)CrossRef
4.
go back to reference Batagelj, V., Mrvar, A.: Pajek-program for large network analysis. Connections 21(2), 47–57 (1998)MATH Batagelj, V., Mrvar, A.: Pajek-program for large network analysis. Connections 21(2), 47–57 (1998)MATH
5.
go back to reference Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 2008(10), P10008 (2008)CrossRef Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 2008(10), P10008 (2008)CrossRef
6.
go back to reference Frenken, K.: A complexity approach to innovation networks. The case of the aircraft industry (1909–1997). Res. Policy 29(2), 257–272 (2000)CrossRef Frenken, K.: A complexity approach to innovation networks. The case of the aircraft industry (1909–1997). Res. Policy 29(2), 257–272 (2000)CrossRef
7.
go back to reference Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Evolutionary many-objective optimization: a short review. In: IEEE Congress on Evolutionary Computation, pp. 2419–2426. Citeseer (2008) Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Evolutionary many-objective optimization: a short review. In: IEEE Congress on Evolutionary Computation, pp. 2419–2426. Citeseer (2008)
8.
go back to reference Kauffman, S., Levin, S.: Towards a general theory of adaptive walks on rugged landscapes. J. Theor. Biol. 128(1), 11–45 (1987)CrossRefMathSciNet Kauffman, S., Levin, S.: Towards a general theory of adaptive walks on rugged landscapes. J. Theor. Biol. 128(1), 11–45 (1987)CrossRefMathSciNet
9.
go back to reference Maulana, A., Jiang, Z., Liu, J., Bäck, T., Emmerich, M.: Reducing complexity in many objective optimization using community detection. In: IEEE Conference on Evolutionary Computation, Sendai, Japan, May 2015 Maulana, A., Jiang, Z., Liu, J., Bäck, T., Emmerich, M.: Reducing complexity in many objective optimization using community detection. In: IEEE Conference on Evolutionary Computation, Sendai, Japan, May 2015
10.
go back to reference van Eck, N.J., Waltman, L.: VOS: a new method for visualizing similarities between objects. In: Decker, R., Lenz, H.-J. (eds.) Advances in Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization, pp. 299–306. Springer, Heidelberg (2007) van Eck, N.J., Waltman, L.: VOS: a new method for visualizing similarities between objects. In: Decker, R., Lenz, H.-J. (eds.) Advances in Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization, pp. 299–306. Springer, Heidelberg (2007)
11.
go back to reference Weinberger, E.D.: Local properties of Kauffmans n-k model: a tunably rugged energy landscape. Phys. Rev. A 44(10), 6399 (1991)CrossRef Weinberger, E.D.: Local properties of Kauffmans n-k model: a tunably rugged energy landscape. Phys. Rev. A 44(10), 6399 (1991)CrossRef
Metadata
Title
Community Detection in NK Landscapes - An Empirical Study of Complexity Transitions in Interactive Networks
Authors
Asep Maulana
André H. Deutz
Erik Schultes
Michael T. M. Emmerich
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-319-69710-9_12

Premium Partner