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 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 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 landscapes with varying values of .
5 More- Received 15 July 2008
DOI:https://doi.org/10.1103/PhysRevE.78.066114
©2008 American Physical Society