HAL : hal-00354804, version 1

arXiv : 1207.4442

DOI : 10.1103/PhysRevE.78.066114

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

Physical Review E: Statistical, Nonlinear, and Soft Matter Physics 78, 6 (2008) 066114

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

Marco Tomassini 1, Sébastien Verel 2, Gabriela Ochoa 3

university of Lausannes ; university of Nothingham Collaboration(s)

(24/12/2008)

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.

1 :	Institut des systèmes d'information (ISI)
	Université de Lausanne
2 :	Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Groupe SCOBI
	Université Nice Sophia Antipolis [UNS] – CNRS : UMR7271
3 :	School of Computer Science
	University of Nottingham

Domaine

:

Informatique/Intelligence artificielle Science non linéaire/Adaptation et Systèmes auto-organisés

Mots Clés : complex networks – graph theory – probability – optimisation

hal-00354804, version 1

http://hal.archives-ouvertes.fr/hal-00354804

oai:hal.archives-ouvertes.fr:hal-00354804

Contributeur : Sébastien Verel <>

Soumis le : Mercredi 18 Juillet 2012, 15:14:34

Dernière modification le : Mercredi 18 Juillet 2012, 20:59:55