Complex-network analysis of combinatorial spaces: The NK landscape case - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Physical Review E : Statistical, Nonlinear, and Soft Matter Physics Année : 2008

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

Résumé

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.
Fichier principal
Vignette du fichier
NKlandscapes-DS.pdf (403.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00354804 , version 1 (18-07-2012)

Identifiants

Citer

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, 2008, 78 (6), pp.066114. ⟨10.1103/PhysRevE.78.066114⟩. ⟨hal-00354804⟩
201 Consultations
278 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More