Complex-network analysis of combinatorial spaces: The NK landscape case

Abstract : We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces. We use the well-known family of NK landscapes as an example. In our case the inherent network is the graph whose vertices represent the local maxima in the landscape, and the edges account for the transition probabilities between their corresponding basins of attraction. We exhaustively extracted such networks on representative NK landscape instances, and performed a statistical characterization of their properties. We found that most of these network properties are related to the search difficulty on the underlying NK landscapes with varying values of K.
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00354804
Contributor : Sébastien Verel <>
Submitted on : Wednesday, July 18, 2012 - 3:14:34 PM
Last modification on : Monday, November 5, 2018 - 3:48:02 PM
Document(s) archivé(s) le : Friday, October 19, 2012 - 2:20:08 AM

Files

NKlandscapes-DS.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Marco Tomassini, Sébastien Verel, Gabriela Ochoa. Complex-network analysis of combinatorial spaces: The NK landscape case. Physical Review E : Statistical, Nonlinear, and Soft Matter Physics, American Physical Society, 2008, 78 (6), pp.066114. ⟨10.1103/PhysRevE.78.066114⟩. ⟨hal-00354804⟩

Share

Metrics

Record views

328

Files downloads

258