2008/10/20 by Sébastien Verel, Sebástien Vérel, Gabriela Ochoa +4 · 2 citations
Computer Science · Physics and Astronomy · Social Sciences · #Complex Network Analysis Techniques #Evolutionary Game Theory and Cooperation #FOS: Computer and information sciences #Neural and Evolutionary Computing (cs.NE) #Opinion Dynamics and Social Influence #cs.NE
paper · pdf · doi:10.48550/arxiv.0810.3492
Artificial Life XI, Winchester : France (2008)
arxiv created 2008/10/20 · openalex publication_date 2008/10/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 where the 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 small NK landscape instances, and performed a statistical characterization of their properties. We found that most of these network properties can be related to the search difficulty on the underlying NK landscapes with varying values of K.