Skip to main content

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

  • Conference paper
  • First Online:
  • 346 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 674))

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\)).

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Named after the university of Louvain-de-Neuve in Belgium where this method was originated.

References

  1. Adriaans, P.: Facticity as the amount of self-descriptive information in a data set (2012). arXiv preprint: arXiv:1203.2245

  2. Altenberg, L.: Nk landscapes. In: Michalewicz, Z., Bäck, T., Fogel, D. (eds.) Handbook of Evolutionary Computation. Oxford University Press (1997)

    Google Scholar 

  3. Anderson, P.: Perspective: complexity theory and organization science. Organ. Sci. 10(3), 216–232 (1999)

    Article  Google Scholar 

  4. Batagelj, V., Mrvar, A.: Pajek-program for large network analysis. Connections 21(2), 47–57 (1998)

    MATH  Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. Frenken, K.: A complexity approach to innovation networks. The case of the aircraft industry (1909–1997). Res. Policy 29(2), 257–272 (2000)

    Article  Google Scholar 

  7. Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Evolutionary many-objective optimization: a short review. In: IEEE Congress on Evolutionary Computation, pp. 2419–2426. Citeseer (2008)

    Google Scholar 

  8. Kauffman, S., Levin, S.: Towards a general theory of adaptive walks on rugged landscapes. J. Theor. Biol. 128(1), 11–45 (1987)

    Article  MathSciNet  Google Scholar 

  9. 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

    Google Scholar 

  10. 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)

    Google Scholar 

  11. Weinberger, E.D.: Local properties of Kauffmans n-k model: a tunably rugged energy landscape. Phys. Rev. A 44(10), 6399 (1991)

    Article  Google Scholar 

Download references

Acknowledgements

Michael Emmerich gratefully acknowledges inspiration from the Lorentz Center Workshop on ‘What is Complexity and How do We Measure it?’ organized by Erik Schultes, Lude Franke, and Peter Adriaans in the Lorentz Center Leiden, November 2014. Asep Maulana gratefully acknowledges financial support by the Indonesian Endowment Fund for Education (LPDP).

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Maulana, A., Deutz, A.H., Schultes, E., Emmerich, M.T.M. (2018). Community Detection in NK Landscapes - An Empirical Study of Complexity Transitions in Interactive Networks. In: Tantar, AA., Tantar, E., Emmerich, M., Legrand, P., Alboaie, L., Luchian, H. (eds) EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation VI. Advances in Intelligent Systems and Computing, vol 674. Springer, Cham. https://doi.org/10.1007/978-3-319-69710-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69710-9_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69708-6

  • Online ISBN: 978-3-319-69710-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics