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.
Type de document :
Article dans une revue
Physical Review E : Statistical, Nonlinear, and Soft Matter Physics, American Physical Society, 2008, 78 (6), pp.066114. <10.1103/PhysRevE.78.066114>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00354804
Contributeur : Sébastien Verel <>
Soumis le : mercredi 18 juillet 2012 - 15:14:34
Dernière modification le : lundi 21 mars 2016 - 11:33:53
Document(s) archivé(s) le : vendredi 19 octobre 2012 - 02:20:08

Fichiers

NKlandscapes-DS.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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>

Partager

Métriques

Consultations de
la notice

249

Téléchargements du document

140